Constant round non-malleable protocols using one way functions
From MaRDI portal
Publication:5419140
DOI10.1145/1993636.1993729zbMath1288.68020OpenAlexW2052605513MaRDI QIDQ5419140
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993729
Related Items (34)
On the round complexity of black-box secure MPC ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ Round optimal black-box ``commit-and-prove ⋮ Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ The security of lazy users in out-of-band authentication ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Adaptively secure computation for RAM programs ⋮ Non-malleable commitments against quantum attacks ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Succinct arguments for RAM programs via projection codes ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Round-optimal black-box MPC in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Concurrent non-malleable statistically hiding commitment ⋮ Blockchains enable non-interactive MPC ⋮ Non-malleable time-lock puzzles and applications ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ An Algebraic Approach to Nonmalleability ⋮ Cryptography Using Captcha Puzzles ⋮ Round-optimal secure multi-party computation ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Post-quantum multi-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function
This page was built for publication: Constant round non-malleable protocols using one way functions
