Concurrent Nonmalleable Commitments
From MaRDI portal
Publication:3549327
DOI10.1137/060661880zbMATH Open1275.94034OpenAlexW2072677341MaRDI QIDQ3549327FDOQ3549327
Authors: Rafael Pass, Alon Rosen 
Publication date: 22 December 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060661880
Recommendations
- Concurrent non-malleable statistically hiding commitment
- Constant-round concurrent non-malleable statistically binding commitments and decommitments
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent non-malleable commitments (and more) in 3 rounds
- Efficient non-malleable commitment schemes
Cited In (26)
- Textbook non-malleable commitments
- Non-interactive universal arguments
- Another step towards realizing random oracles: non-malleable point obfuscation
- Concurrent knowledge extraction in public-key models
- Round optimal concurrent non-malleability from polynomial hardness
- Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
- Concurrent non-malleable statistically hiding commitment
- Non-malleability vs. CCA-security: the case of commitments
- Concurrent non-malleable commitments (and more) in 3 rounds
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Concurrent security and non-malleability
- Title not available (Why is that?)
- Constant-round concurrent non-malleable statistically binding commitments and decommitments
- Concurrent Non-malleable Commitments from Any One-Way Function
- Non-malleable commitments against quantum attacks
- SPARKs: succinct parallelizable arguments of knowledge
- Super-Perfect Zero-Knowledge Proofs
- Nonmalleable extractors and codes, with their many tampered extensions
- On non-black-box simulation and the impossibility of approximate obfuscation
- On constant-round concurrent non-malleable proof systems
- Four-round black-box non-malleable schemes from one-way permutations
- Multi-prover commitments against non-signaling attacks
- Non-malleable time-lock puzzles and applications
- Non-malleable instance-dependent commitment in the standard model
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments
This page was built for publication: Concurrent Nonmalleable Commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549327)
