scientific article; zbMATH DE number 1942446

zbMATH Open1028.94511MaRDI QIDQ4409145FDOQ4409145

Authors: Anna Lysyanskaya 

Publication date: 30 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420597.htm

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

verifiable random functionsapplication of groups with DH-DDH separationUnique signatures

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (38)

• Encapsulated search index: public-key, sub-linear, distributed, and delegatable
• KDM security for identity-based encryption: constructions and separations
• The price of verifiability: lower bounds for verifiable random functions
• Subversion-resilient signatures: definitions, constructions and applications
• Verifiable Random Functions from Identity-Based Key Encapsulation
• Efficient selective identity-based encryption without random oracles
• Computing on authenticated data
• On the security loss of unique signatures
• Memory lower bounds of reductions revisited
• From Identification to Signatures, Tightly: A Framework and Generic Transforms
• Logarithmic-size (linkable) threshold ring signatures in the plain model
• Multiparty non-interactive key exchange and more from isogenies on elliptic curves
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Explainable arguments
• Certificate-Based Signature Schemes without Pairings or Random Oracles
• Shielded computations in smart contracts overcoming forks
• Practical post-quantum few-time verifiable random function with applications to Algorand
• Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
• A novel certificateless multi-signature scheme over NTRU lattices
• The random oracle model: a twenty-year retrospective
• Cliptography: clipping the power of kleptographic attacks
• Verifiable random functions: relations to identity-based key encapsulation and new constructions
• Pseudorandom functions: three decades later
• Several cryptographic applications of \(\Sigma\)-protocol
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
• Unique signature with short output from CDH assumption
• Verifiable random functions from standard assumptions
• Unbiasable verifiable random functions
• A novel identity-based multi-signature scheme over NTRU lattices
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Two-party adaptor signatures from identification schemes
• Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
• Traceable secret sharing: strong security and efficient constructions
• Efficient rational secret sharing in standard communication networks
• Mercurial commitments with applications to zero-knowledge sets
• On the impossibility of structure-preserving deterministic primitives
• Simulatable verifiable random function from the LWE assumption
• Certificateless key-insulated signature without random oracles

This page was built for publication:

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