scientific article; zbMATH DE number 2009953

MaRDI QIDQ4434873zbMATHFDO

Authors Daniele Micciancio, Erez Petrank

Publication date 26 November 2003

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
• scientific article; zbMATH DE number 1304087

Cited in

(15)

• Concurrent knowledge extraction in public-key models
• Efficient Zero Knowledge on the Internet
• A new approach to efficient non-malleable zero-knowledge
• 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
• Optimally sound sigma protocols under DCRA
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Automata, Languages and Programming
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• Hybrid commitments and their applications to zero-knowledge proof systems
• An Equivalence Between Zero Knowledge and Commitments
• Collusion-Free Protocols in the Mediated Model
• Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
• Individual simulations

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 Q4434873)