Unique signatures and verifiable random functions from the DH-DDH separation
From MaRDI portal
Recommendations
- Unique signature with short output from CDH assumption
- Efficient construction of (distributed) verifiable random functions
- Verifiable random functions from weaker assumptions
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Public Key Cryptography - PKC 2005
Cited in
(43)- On the security loss of unique signatures
- Memory lower bounds of reductions revisited
- On the impossibility of structure-preserving deterministic primitives
- Subversion-resilient signatures: definitions, constructions and applications
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Two-party adaptor signatures from identification schemes
- Shielded computations in smart contracts overcoming forks
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- KDM security for identity-based encryption: constructions and separations
- Computing on authenticated data
- Mercurial commitments with applications to zero-knowledge sets
- A novel identity-based multi-signature scheme over NTRU lattices
- Simulatable verifiable random function from the LWE assumption
- Verifiable random functions from standard assumptions
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Cliptography: clipping the power of kleptographic attacks
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Efficient rational secret sharing in standard communication networks
- Unique signature with short output from CDH assumption
- Certificate-Based Signature Schemes without Pairings or Random Oracles
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Several cryptographic applications of -protocol
- Pseudorandom functions: three decades later
- A novel certificateless multi-signature scheme over NTRU lattices
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Explainable arguments
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- 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
- Certificateless key-insulated signature without random oracles
- Efficient selective identity-based encryption without random oracles
- Unbiasable verifiable random functions
- Traceable secret sharing: strong security and efficient constructions
- Traceable verifiable random functions
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- Key-homomorphic and aggregate verifiable random functions
- Breaking X-VRF, a post-quantum verifiable random function (short paper)
- Constrained verifiable random functions without obfuscation and friends
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- The random oracle model: a twenty-year retrospective
This page was built for publication: Unique signatures and verifiable random functions from the DH-DDH separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409145)
