Adaptive One-Way Functions and Applications

DOI10.1007/978-3-540-85174-5_4zbMath1183.94044OpenAlexW1551902067MaRDI QIDQ3600213

Rafael Pass, Omkant Pandey, Vinod Vaikuntanathan

Publication date: 10 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_4

zbMATH Keywords

cryptographic assumptionsnon-malleable commitmentnon-malleable zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (28)

Non-malleable functions and their applications ⋮ Toward RSA-OAEP Without Random Oracles ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ The security of lazy users in out-of-band authentication ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Non-malleable commitments against quantum attacks ⋮ Maliciously-secure MrNISC in the plain model ⋮ Concurrently composable non-interactive secure computation ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Parallel repetition of computationally sound protocols revisited ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Non-malleable vector commitments via local equivocability ⋮ Non-malleable time-lock puzzles and applications ⋮ Cryptography Using Captcha Puzzles ⋮ Non-malleable vector commitments via local equivocability ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ Post-quantum multi-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ On selective-opening security of deterministic primitives ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function

This page was built for publication: Adaptive One-Way Functions and Applications