On constant-round concurrent non-malleable proof systems

DOI10.1016/J.IPL.2011.06.004zbMATH Open1260.94038OpenAlexW1990515315MaRDI QIDQ1944155FDOQ1944155

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

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

zbMATH Keywords

cryptographyzero-knowledge proofsconcurrent non-malleabilitywitness-indistinguishable proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

Cited In (6)

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

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)