Adaptive One-Way Functions and Applications

DOI10.1007/978-3-540-85174-5_4MaRDI QIDQ3600213zbMATH OpenOpenAlexFDO

Authors Omkant Pandey, Rafael Pass, 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)

Recommendations

• Absolute results concerning one-way functions and their applications
• Generic Case Complexity and One-Way Functions
• The many entropies in one-way functions
• Towards non-black-box lower bounds in cryptography
• Cryptographic assumptions: a position paper

Cited in

(34)

• 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
• Post-quantum multi-party computation
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• On selective-opening security of deterministic primitives
• Non-malleable functions and their applications
• Non-malleable codes for bounded parallel-time tampering
• Non-malleable commitments against quantum attacks
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Two-round maliciously secure computation with super-polynomial simulation
• Non-malleable vector commitments via local equivocability
• Non-malleable time-lock puzzles and applications
• Cryptographic assumptions: a position paper
• Adaptive hardness and composable security in the plain model from standard assumptions
• Concurrent non-malleable commitments (and more) in 3 rounds
• Expedient Non-malleability Notions for Hash Functions
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Parallel repetition of computationally sound protocols revisited
• Cryptography using \texttt{CAPTCHA} puzzles
• Toward RSA-OAEP without random oracles
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Non-malleable vector commitments via local equivocability
• Maliciously-secure MrNISC in the plain model
• Concurrently composable non-interactive secure computation
• On non-uniform security for black-box non-interactive CCA commitments
• A new approach to efficient non-malleable zero-knowledge
• Two-round concurrent 2PC from sub-exponential LWE
• Registration-based encryption in the plain model
• Adversarially robust learning could leverage computational hardness.
• Almost-total puzzles and their applications
• Seedless condensers for efficiently samplable sources

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600213)