Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/B97182MaRDI QIDQ5307265zbMATH OpenOpenAlexFDO

Authors Ke Yang, Philip MacKenzie

Publication date 25 September 2007

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• New constructions of efficient simulation-sound commitments using encryption and their applications
• Automata, Languages and Programming
• Hybrid commitments and their applications to zero-knowledge proof systems
• scientific article; zbMATH DE number 2009953
• scientific article; zbMATH DE number 1942445

Cited in

(24)

• Efficient non-malleable commitment schemes
• GNUC: a new universal composability framework
• All-but-many encryption
• Efficient non-malleable commitment schemes
• Perfect Non-interactive Zero Knowledge for NP
• Concurrent non-malleable statistically hiding commitment
• Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms
• GUC-secure commitments via random oracles: new impossibility and feasibility
• Hybrid commitments and their applications to zero-knowledge proof systems
• Linearly homomorphic structure-preserving signatures and their applications
• Secure two-party computation via cut-and-choose oblivious transfer
• Cryptography in the multi-string model
• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• SAS-Based Group Authentication and Key Agreement Protocols
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• UC commitments for modular protocol design and applications to revocation and attribute tokens
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Resource fairness and composability of cryptographic protocols
• New approaches for deniable authentication
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• Zero-Knowledge Accumulators and Set Algebra
• Automata, Languages and Programming

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004

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