Simulatable commitments and efficient concurrent zero-knowledge

DOI10.1007/3-540-39200-9_9MaRDI QIDQ4434873zbMATH OpenFDO

Authors Daniele Micciancio, Erez Petrank

Publication date 26 November 2003

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

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

zbMATH Keywords

interactive proof systemsimulatable commitmentszero knowledge proof system

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Hybrid commitments and their applications to zero-knowledge proof systems
• Efficient Zero Knowledge on the Internet
• Automata, Languages and Programming
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• On the concurrent composition of zero-knowledge proofs

Cited in

(15)

• Hybrid commitments and their applications to zero-knowledge proof systems
• Individual simulations
• Concurrent knowledge extraction in public-key models
• Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Efficient Zero Knowledge on the Internet
• Collusion-Free Protocols in the Mediated Model
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• Advances in Cryptology - EUROCRYPT 2004
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• An Equivalence Between Zero Knowledge and Commitments
• Automata, Languages and Programming
• Optimally sound sigma protocols under DCRA
• A new approach to efficient non-malleable zero-knowledge

This page was built for publication: Simulatable commitments and efficient concurrent zero-knowledge

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