Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

PKC
2005
Springer

favoriteEmaildiscussreport

98views Cryptology» more PKC 2005»

A Verifiable Random Function with Short Proofs and Keys

14 years 4 months ago

A Verifiable Random Function with Short Proofs and Keys

Download www.cs.yale.edu

Yevgeniy Dodis, Aleksandr Yampolskiy

Real-time Traffic

Cryptography | PKC 2005 |

claim paper

Related Content

» InstanceDependent Verifiable Random Functions and Their Application to Simultaneous Resett...

» Verifiable Random Functions from IdentityBased Key Encapsulation

» Short Designated Verifier Signature Scheme and Its Identitybased Variant

» Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs

» A Verified Compiler for an Impure Functional Language

» Weak Verifiable Random Functions

» Formal Indistinguishability Extended to the Random Oracle Model

» Batch Verification of Short Signatures

» Short Redactable Signatures Using Random Trees

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	PKC
Authors	Yevgeniy Dodis, Aleksandr Yampolskiy

Comments (0)