Back to Results
First PageMeta Content
One-way function / Pseudorandom generator theorem / Hard-core predicate / Random oracle / Verifiable random function / Trapdoor function / Pseudorandom function family / Pseudorandom generator / Pseudorandom permutation / Cryptography / Pseudorandomness / Cryptographic hash functions


Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations? Dario Fiore1 and Dominique Schr¨oder2 1
Add to Reading List

Document Date: 2011-09-15 13:18:51


Open Document

File Size: 450,06 KB

Share Result on Facebook

/

EntertainmentAwardEvent

the Emmy / /

Facility

University of Maryland / /

IndustryTerm

theoretical and practical applications / derivation algorithm / deterministic algorithm / probabilistic algorithm / evaluation algorithm / verification algorithm / encryption algorithm / non-interactive lottery systems / /

Organization

German Research Foundation / Ecole Normale Sup´erieure / University of Maryland / European Commission / /

Person

Dominique Schr / Rabin / Verifiable Random / /

Position

author / /

TVStation

KGO / /

Technology

verification algorithm / encryption / deterministic algorithm / e.g. semantically-secure public-key encryption / identity-based encryption / cryptography / private key / secret key / semantically-secure public-key encryption / public key / key-agreement protocols / private-key encryption / identiy-based encryption / public-key encryption / encryption algorithm / evaluation algorithm / probabilistic algorithm / key derivation algorithm / CCA encryption / /

SocialTag