<--- Back to Details
First PageDocument Content
Academic publishing / Open access / Research / Communication / Electronic publishing / Self-archiving / Citebase / CogPrints / Stevan Harnad / Scientific Research Publishing / Eprint / Berlin Declaration on Open Access to Knowledge in the Sciences and Humanities
Date: 2008-08-04 19:49:42
Academic publishing
Open access
Research
Communication
Electronic publishing
Self-archiving
Citebase
CogPrints
Stevan Harnad
Scientific Research Publishing
Eprint
Berlin Declaration on Open Access to Knowledge in the Sciences and Humanities

doi:j.serrev

Add to Reading List

Source URL: depts.washington.edu

Download Document from Source Website

File Size: 294,43 KB

Share Document on Facebook

Similar Documents

Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby⋆ Ioanna Tzialla◦ abhi shelat†

DocID: 1xW0V - View Document

Cryptography / Mathematics / Number theory / Post-quantum cryptography / Spectral theory / Algebra / Distribution / Pseudorandom function family / Learning with errors / Jordan normal form / Decomposition of spectrum

A Bit-fixing PRF with O(1) Collusion-Resistance from LWE Alex Davidson1,? and Ryo Nishimaki2 1 2

DocID: 1xVY7 - View Document

Cryptography / Artificial intelligence / Human-based computation / Computing / Cryptocurrencies / CAPTCHA / Computer security / Computer vision / Proof-of-work system / Hashcash / Challengeresponse authentication / Zero-knowledge proof

Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond∗ Jeremiah Blocki Purdue University, Hong-Sheng Zhou Virginia Commonwealth University,

DocID: 1xVWJ - View Document

Cryptography / Public-key cryptography / Elliptic curve cryptography / Digital Signature Standard / Key management / Elliptic Curve Digital Signature Algorithm / Digital signature / Digital Signature Algorithm / EdDSA / Key / Domain Name System Security Extensions / Homomorphic encryption

Short Double- and N -Times-Authentication-Preventing Signatures from ECDSA and More David Derler1 , Sebastian Ramacher1 , and Daniel Slamanig2 1

DocID: 1xVQK - View Document

Algebra / Mathematics / Multilinear algebra / Non-interactive zero-knowledge proof / Proof theory / IP / Snark / Zero-knowledge proof / Zero knowledge / Soundness / Bilinear map / Model theory

On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

DocID: 1xVKy - View Document