Non-malleable commitments against quantum attacks

DOI10.1007/978-3-031-07082-2_19zbMATH Open1502.81021OpenAlexW3196549824MaRDI QIDQ2170101FDOQ2170101

Authors: Nir Bitansky, Huijia Lin, Omri Shmueli 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_19

Recommendations

• Non-interactive non-malleability from quantum supremacy
• Textbook non-malleable commitments
• Classical binding for quantum commitments
• Concurrent Nonmalleable Commitments
• Constant-round non-malleable commitments from sub-exponential one-way functions

Mathematics Subject Classification ID

Derivative securities (option pricing, hedging, etc.) (91G20) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• A single quantum cannot be cloned
• Bit commitment using pseudorandomness
• Universal Arguments and their Applications
• Constant-round non-malleable commitments from any one-way function
• Constant-round non-malleable commitments from sub-exponential one-way functions
• New and improved constructions of non-malleable cryptographic protocols
• Adaptive One-Way Functions and Applications
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Non-malleability amplification
• Constant round non-malleable protocols using one way functions
• Concurrent Non-malleable Commitments from Any One-Way Function
• Theory of Cryptography
• A unified framework for concurrent security
• Fully simulatable quantum-secure coin-flipping and applications
• Nonmalleable Cryptography
• Quantum proofs of knowledge
• Classical cryptographic protocols in a quantum world
• One-message zero knowledge and non-malleable commitments
• Round optimal concurrent non-malleability from polynomial hardness
• Adaptive hardness and composable security in the plain model from standard assumptions
• Concurrent non-malleable commitments (and more) in 3 rounds
• Black-box constructions of composable protocols without set-up
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Textbook non-malleable commitments
• Efficient chosen-ciphertext security via extractable hash proofs
• Post-quantum multi-party computation
• Black-box non-interactive non-malleable commitments
• Non-interactive non-malleability from quantum supremacy
• Post-quantum zero knowledge in constant rounds
• Secure quantum extraction protocols

Cited In (8)

• Black-box separations for non-interactive classical commitments in a quantum world
• Efficient NIZKs and signatures from commit-and-open protocols in the QROM
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• Non-interactive non-malleability from quantum supremacy
• Non-Observable Quantum Random Oracle Model
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Classical binding for quantum commitments
• Multi-prover commitments against non-signaling attacks

This page was built for publication: Non-malleable commitments against quantum attacks

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