Verifiable random functions from standard assumptions
From MaRDI portal
Recommendations
- Verifiable random functions from weaker assumptions
- Constructing verifiable random functions with large input spaces
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Public Key Cryptography - PKC 2005
- Efficient Construction of (Distributed) Verifiable Random Functions
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Bonsai trees, or how to delegate a lattice basis
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Certifying RSA
- Circular-Secure Encryption from Decision Diffie-Hellman
- Compact E-Cash and Simulatable VRFs Revisited
- Constrained verifiable random functions
- Constructing verifiable random functions with large input spaces
- Dual form signatures: an approach for proving security from static assumptions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Déjà Q: using dual systems to revisit \(q\)-type assumptions
- Efficient Construction of (Distributed) Verifiable Random Functions
- Efficient Identity-Based Encryption Without Random Oracles
- From selective to full security: semi-generic transformations in the standard model
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- scientific article; zbMATH DE number 2079926 (Why is no real title available?)
- scientific article; zbMATH DE number 1842510 (Why is no real title available?)
- Number-theoretic constructions of efficient pseudo-random functions
- Practical Compact E-Cash
- Programmable Hash Functions and Their Applications
- Programmable hash functions in the multilinear setting
- Public Key Cryptography - PKC 2005
- Public-Key Cryptosystems Resilient to Key Leakage
- Security Analysis of the Strong Diffie-Hellman Problem
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Updatable Zero-Knowledge Databases
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Verifiable random functions from weaker assumptions
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Weak Verifiable Random Functions
Cited in
(23)- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Verifiable random functions with optimal tightness
- On the round complexity of randomized Byzantine agreement
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Partitioned searchable encryption
- Simulatable verifiable random function from the LWE assumption
- Constructing verifiable random functions with large input spaces
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Verifiable random functions from weaker assumptions
- Public Key Cryptography - PKC 2005
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- 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
- Unbiasable verifiable random functions
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- Key-homomorphic and aggregate verifiable random functions
- Communication lower bounds for cryptographic broadcast protocols
- Constrained verifiable random functions without obfuscation and friends
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
This page was built for publication: Verifiable random functions from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796131)
