Advances in Cryptology – CRYPTO 2004

DOI10.1007/B99099zbMATH Open1104.94050DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311535FDOQ5311535

Authors: Rosario Gennaro 

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99099

Recommendations

• Automata, Languages and Programming
• A multi-trapdoor commitment scheme from the RSA assumption
• Multi-prover commitments against non-signaling attacks
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• On the power of multi-prover interactive protocols
• Hybrid commitments and their applications to zero-knowledge proof systems
• Non-interactive zero-knowledge proofs to multiple verifiers
• On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments

Mathematics Subject Classification ID

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

Cited In (27)

• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
• New receipt-free voting scheme using double-trapdoor commitment
• New unbounded verifiable data streaming for batch query with almost optimal overhead
• All-but-many encryption
• Efficient non-malleable commitment schemes
• Concurrent non-malleable statistically hiding commitment
• Identity-based trapdoor mercurial commitments and applications
• Identification schemes from key encapsulation mechanisms
• Hybrid commitments and their applications to zero-knowledge proof systems
• Novel \(\Omega\)-protocols for NP
• Linearly homomorphic structure-preserving signatures and their applications
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Removing the strong RSA assumption from arguments over the integers
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• Efficient generic on-line/off-line (threshold) signatures without key exposure
• Designated confirmer signatures with unified verification
• Identity-based chameleon hashing and signatures without key exposure
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• A multi-trapdoor commitment scheme from the RSA assumption
• Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
• Scalable zero knowledge via cycles of elliptic curves
• New approaches for deniable authentication
• New Constructions and Applications of Trapdoor DDH Groups
• Automata, Languages and Programming
• Efficient non-malleable commitment schemes

This page was built for publication: Advances in Cryptology – CRYPTO 2004

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