On constant-round concurrent non-malleable proof systems

DOI10.1016/j.ipl.2011.06.004zbMath1260.94038OpenAlexW1990515315MaRDI QIDQ1944155

Ivan Visconti, Zhen Fu Cao, Zong-yang 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)

Related Items (2)

Constant-round adaptive zero-knowledge proofs for NP ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid commitments and their applications to zero-knowledge proof systems
• Strengthening zero-knowledge protocols using signatures
• Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Concurrent Nonmalleable Commitments
• Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
• Concurrent Non-Malleable Zero Knowledge Proofs
• Universally Composable Security with Global Setup
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• Nonmalleable Cryptography
• A unified framework for concurrent security
• Advances in Cryptology - CRYPTO 2003
• Zaps and Their Applications
• Automata, Languages and Programming
• Non-interactive Zaps and New Techniques for NIZK

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