Concurrent non-malleable commitments (and more) in 3 rounds
From MaRDI portal
Publication:2829950
DOI10.1007/978-3-662-53015-3_10zbMATH Open1406.94039OpenAlexW2483868393MaRDI QIDQ2829950FDOQ2829950
Authors: Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, 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
Recommendations
- Round optimal concurrent non-malleability from polynomial hardness
- Concurrent Nonmalleable Commitments
- Four-round concurrent non-malleable commitments from one-way functions
- Constant-round non-malleable commitments from any one-way function
- Constant-Round Nonmalleable Commitments from Any One-Way Function
Cites Work
- 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
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Advances in Cryptology – CRYPTO 2004
- Constant-round non-malleable commitments from any one-way function
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- Zero-knowledge proofs of identity
- Constant-round non-malleable commitments from sub-exponential one-way functions
- New and improved constructions of non-malleable cryptographic protocols
- Adaptive One-Way Functions and Applications
- Constant round non-malleable protocols using one way functions
- Concurrent Non-malleable Commitments from Any One-Way Function
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Constant-round concurrent non-malleable statistically binding commitments and decommitments
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments
- Title not available (Why is that?)
- A unified framework for concurrent security
- Continuous non-malleable codes
- Bounded-concurrent secure multi-party computation with a dishonest majority
- The Exact Round Complexity of Secure Computation
- On constant-round concurrent non-malleable proof systems
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Improved OR-composition of sigma-protocols
- On the Power of Secure Two-Party Computation
- Concurrent non-malleable commitments (and more) in 3 rounds
- Textbook non-malleable commitments
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Fiat-Shamir for highly sound protocols is instantiable
- Online/offline OR composition of sigma protocols
- Title not available (Why is that?)
- Revisiting lower and upper bounds for selective decommitments
Cited In (23)
- Non-interactive Mimblewimble transactions, revisited
- On non-uniform security for black-box non-interactive CCA commitments
- Post-quantum multi-party computation
- An Algebraic Approach to Nonmalleability
- Delayed-input cryptographic protocols
- Round-optimal secure multi-party computation
- One-message zero knowledge and non-malleable commitments
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Four-round concurrent non-malleable commitments from one-way functions
- Non-malleable codes for bounded parallel-time tampering
- Round optimal concurrent non-malleability from polynomial hardness
- Concurrent non-malleable commitments (and more) in 3 rounds
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- On the round complexity of black-box secure MPC
- Constant-round concurrent non-malleable statistically binding commitments and decommitments
- Non-malleable commitments against quantum attacks
- Black-box non-interactive non-malleable commitments
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Concurrent Nonmalleable Commitments
- Four-round black-box non-malleable schemes from one-way permutations
- Non-malleable time-lock puzzles and applications
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments
This page was built for publication: Concurrent non-malleable commitments (and more) in 3 rounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829950)
