A verifiable random function with short proofs and keys
From MaRDI portal
Recommendations
- Efficient construction of (distributed) verifiable random functions
- The price of verifiability: lower bounds for verifiable random functions
- Constructing verifiable random functions with large input spaces
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Verifiable random functions from standard assumptions
Cited in
(85)- Provably secure group key management scheme based on proxy re-encryption with constant public bulletin size and key derivation time
- Adaptively secure distributed PRFs from LWE
- On the impossibility of structure-preserving deterministic primitives
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Subversion-resilient signatures: definitions, constructions and applications
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Aggregatable distributed key generation
- Two-server distributed ORAM with sublinear computation and constant rounds
- Two-sided malicious security for private intersection-sum with cardinality
- Implementing secure reporting of sexual misconduct -- revisiting WhoToo
- PoSAT: proof-of-work availability and unpredictability, without the work
- Practical post-quantum few-time verifiable random function with applications to Algorand
- A fast and simple partially oblivious PRF, with applications
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Public-key generation with verifiable randomness
- A combinatorial approach to quantum random functions
- Simulatable verifiable random function from the LWE assumption
- Verifiable random functions from standard assumptions
- Non-zero inner product encryption with short ciphertexts and private keys
- Constrained verifiable random functions
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Sub-linear size traceable ring signatures without random oracles
- Simulatable adaptive oblivious transfer with statistical receiver's privacy
- Unforgeability of re-encryption keys against collusion attack in proxy re-encryption
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Compact E-Cash and Simulatable VRFs Revisited
- Efficient rational secret sharing in standard communication networks
- Constructing verifiable random functions with large input spaces
- Security Analysis of the Strong Diffie-Hellman Problem
- Practical Identity-Based Encryption Without Random Oracles
- Efficient Protocols for Set Membership and Range Proofs
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Unique signatures and verifiable random functions from the DH-DDH separation
- Efficient construction of (distributed) verifiable random functions
- A timed-release proxy re-encryption scheme and its application to fairly-opened multicast communication
- Distribution and polynomial interpolation of the Dodis-Yampolskiy pseudo-random function
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Discrete logarithm problems with auxiliary inputs
- Explainable arguments
- Anonymous tokens with public metadata and applications to private contact tracing
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
- A composable security treatment of ECVRF and batch verifications
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- The price of verifiability: lower bounds for verifiable random functions
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- Practical verifiable random function with RKA security
- Anonymous counting tokens
- Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption
- Traceable secret sharing: strong security and efficient constructions
- MUSEN: aggregatable key-evolving verifiable random functions and applications
- Efficient succinct zero-knowledge arguments in the CL framework
- Taming iterative grinding attacks on blockchain beacons
- Traceable verifiable random functions
- OCash: fully anonymous payments between blockchain light clients
- Key-homomorphic and aggregate verifiable random functions
- Oblivious identity-based encryption. IBE secure against an adversarial KGC
- Breaking X-VRF, a post-quantum verifiable random function (short paper)
- \textsf{Goldfish}: No more attacks on Ethereum?!
- Game-theoretic randomness for proof-of-stake
- The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
- On the concrete security of BBS/BBS+ signatures
- Everlasting anonymous rate-limited tokens
- Constrained verifiable random functions without obfuscation and friends
- Another look at the quantum security of the vectorization problem with shifted inputs
- OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
- Malicious private set union with two-sided output
- Lattice EPID with efficient revocation
- Partial fraction techniques for cryptography
- PACIFIC: privacy-preserving automated contact tracing featuring integrity against cloning
- Amortizing Circuit-PSI in the multiple sender/receiver setting
- Efficient maliciously secure oblivious exponentiations
- Efficient construction of threshold BBS+ signatures and its extensions
- MATSE: amortized threshold symmetric-key encryption for matrices
- 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
- Balancing privacy and accountability in blockchain identity management
This page was built for publication: A verifiable random function with short proofs and keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711583)
