Verifiable random functions from weaker assumptions
From MaRDI portal
Publication:5261672
DOI10.1007/978-3-662-46497-7_5zbMATH Open1379.94042OpenAlexW2150792012MaRDI QIDQ5261672FDOQ5261672
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
Recommendations
Cited In (25)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- The price of verifiability: lower bounds for verifiable random functions
- Subversion-resilient signatures: definitions, constructions and applications
- Weak Verifiable Random Functions
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Indistinguishability Obfuscation: From Approximate to Exact
- Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
- Efficient Construction of (Distributed) Verifiable Random Functions
- On the security loss of unique signatures
- Adaptively secure distributed PRFs from LWE
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- Title not available (Why is that?)
- 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
- Identity-based encryption from LWE with more compact master public key
- 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
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Multi-client inner product encryption: function-hiding instantiations without random oracles
- Verifiable Random Functions from Standard Assumptions
- Practical verifiable random function with RKA security
- Simulatable verifiable random function from the LWE assumption
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)
