On constant-round concurrent non-malleable proof systems

DOI10.1016/J.IPL.2011.06.004MaRDI QIDQ1944155zbMATH OpenOpenAlexFDO

Authors Ivan Visconti, Zhenfu Cao, Zongyang Zhang

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.06.004

zbMATH Keywords

cryptographyzero-knowledge proofsconcurrent non-malleabilitywitness-indistinguishable proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Concurrent non-malleable zero knowledge proofs
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• On Input Indistinguishable Proof Systems
• On Constant-Round Concurrent Zero-Knowledge
• Concurrent non-malleable zero knowledge with adaptive inputs

Cites work

• scientific article; zbMATH DE number 1304087 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1842511 (Why is no real title available?)
• A unified framework for concurrent security
• Advances in Cryptology - CRYPTO 2003
• Automata, Languages and Programming
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Concurrent Nonmalleable Commitments
• Concurrent non-malleable zero knowledge proofs
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Constant-round concurrent non-malleable statistically binding commitments and decommitments
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Foundations of Cryptography
• Hybrid commitments and their applications to zero-knowledge proof systems
• Non-interactive Zaps and New Techniques for NIZK
• Nonmalleable Cryptography
• Strengthening zero-knowledge protocols using signatures
• The Knowledge Complexity of Interactive Proof Systems
• Universally Composable Security with Global Setup
• Zaps and Their Applications

Cited in

(6)

• Concurrent non-malleable commitments (and more) in 3 rounds
• Constant-round adaptive zero-knowledge proofs for NP
• Constant-Round Interactive Proof Systems for AC0[2] and NC1
• Concurrent security and non-malleability
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Concurrent non-malleable zero knowledge proofs

This page was built for publication: On constant-round concurrent non-malleable proof systems

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