Verifiable random functions from weaker assumptions

DOI10.1007/978-3-662-46497-7_5MaRDI QIDQ5261672zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Verifiable random functions from standard assumptions
• Constructing verifiable random functions with large input spaces
• The price of verifiability: lower bounds for verifiable random functions
• Efficient Construction of (Distributed) Verifiable Random Functions
• Weak Verifiable Random Functions

Cited in

(38)

• On the security loss of unique signatures
• Adaptively secure distributed PRFs from LWE
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• A generic approach to constructing and proving verifiable random functions
• Subversion-resilient signatures: definitions, constructions and applications
• 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
• 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
• Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
• Simulatable verifiable random function from the LWE assumption
• Indistinguishability obfuscation: from approximate to exact
• Verifiable random functions from standard assumptions
• Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
• Constructing verifiable random functions with large input spaces
• Weak Verifiable Random Functions
• Verifiable Random Functions from Identity-Based Key Encapsulation
• scientific article; zbMATH DE number 1942446 (Why is no real title available?)
• Efficient Construction of (Distributed) Verifiable Random Functions
• Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• Classical and quantum security of elliptic curve VRF, via relative indifferentiability
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
• Multi-client inner product encryption: function-hiding instantiations without random oracles
• Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
• The price of verifiability: lower bounds for verifiable random functions
• Practical verifiable random function with RKA security
• Identity-based encryption from LWE with more compact master public key
• Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
• Key-homomorphic and aggregate verifiable random functions
• Constrained verifiable random functions without obfuscation and friends
• Capybara and Tsubaki: verifiable random functions from group actions and isogenies
• Verifiable random functions: relations to identity-based key encapsulation and new constructions
• On the real-world instantiability of admissible hash functions and efficient verifiable random functions

This page was built for publication: Verifiable random functions from weaker assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261672)