Verifiable Random Functions from Weaker Assumptions

DOI10.1007/978-3-662-46497-7_5zbMath1379.94042OpenAlexW2150792012MaRDI QIDQ5261672

Tibor Jager

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

On the security loss of unique signatures ⋮ Adaptively secure distributed PRFs from LWE ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness ⋮ Adaptively secure constrained pseudorandom functions in the standard model

This page was built for publication: Verifiable Random Functions from Weaker Assumptions