Efficient Construction of (Distributed) Verifiable Random Functions

DOI10.1007/3-540-36288-6_1zbMath1033.94521OpenAlexW1981757200MaRDI QIDQ4414694

Yevgeniy Dodis

Publication date: 27 July 2003

Published in: Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36288-6_1

zbMATH Keywords

pseudorandom functionsdigital signaturesverifiable random functions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (15)

Adaptively secure distributed PRFs from LWE ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Encapsulated search index: public-key, sub-linear, distributed, and delegatable ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ Simulatable verifiable random function from the LWE assumption ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Practical Identity-Based Encryption Without Random Oracles ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Efficient Rational Secret Sharing in Standard Communication Networks

This page was built for publication: Efficient Construction of (Distributed) Verifiable Random Functions