Concurrent Non-Malleable Commitments (and More) in 3 Rounds
From MaRDI portal
Publication:2829950
DOI10.1007/978-3-662-53015-3_10zbMath1406.94039MaRDI QIDQ2829950
Luisa Siniscalchi, Michele Ciampi, Rafail Ostrovsky, Ivan Visconti
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://link.springer.com/chapter/10.1007%2F978-3-662-53015-3_10
94A60: Cryptography
Related Items
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles, An Algebraic Approach to Nonmalleability, Round-optimal secure multi-party computation, Four-round black-box non-malleable schemes from one-way permutations, On non-uniform security for black-box non-interactive CCA commitments, One-message zero knowledge and non-malleable commitments, Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments, Delayed-input cryptographic protocols, Post-quantum multi-party computation, Black-box non-interactive non-malleable commitments, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, On the round complexity of black-box secure MPC, Non-malleable codes for bounded parallel-time tampering, Non-malleable commitments against quantum attacks, Non-malleable time-lock puzzles and applications, Concurrent Non-Malleable Commitments (and More) in 3 Rounds, Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-knowledge proofs of identity
- On constant-round concurrent non-malleable proof systems
- Improved OR-Composition of Sigma-Protocols
- Fiat–Shamir for Highly Sound Protocols Is Instantiable
- On the Power of Secure Two-Party Computation
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Simultaneously Resettable Arguments of Knowledge
- On Round-Optimal Zero Knowledge in the Bare Public-Key Model
- Resettable zero-knowledge (extended abstract)
- 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
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New and improved constructions of non-malleable cryptographic protocols
- Adaptive One-Way Functions and Applications
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
- Revisiting Lower and Upper Bounds for Selective Decommitments
- A unified framework for concurrent security
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Textbook non-malleable commitments
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Online/Offline OR Composition of Sigma Protocols
- The Exact Round Complexity of Secure Computation
- Continuous Non-malleable Codes
