New and improved constructions of non-malleable cryptographic protocols
From MaRDI portal
Publication:3581449
DOI10.1145/1060590.1060670zbMath1192.94104OpenAlexW2077140897MaRDI QIDQ3581449
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.267
Related Items
Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Non-malleable commitments against quantum attacks ⋮ Witness-succinct universally-composable SNARKs ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Non-malleable time-lock puzzles and applications ⋮ An Algebraic Approach to Nonmalleability ⋮ Cryptography Using Captcha Puzzles ⋮ Novel \(\Omega\)-protocols for NP ⋮ Completely Non-malleable Encryption Revisited ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ The Complexity of Zero Knowledge ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Black-box non-interactive non-malleable commitments ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function
