Non-malleable commitments against quantum attacks

DOI10.1007/978-3-031-07082-2_19zbMath1502.81021OpenAlexW3196549824MaRDI QIDQ2170101

Nir Bitansky, Omri Shmueli, Huijia Lin

Publication date: 30 August 2022

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

Mathematics Subject Classification ID

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

Related Items

Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round

Cites Work

• Bit commitment using pseudorandomness
• One-message zero knowledge and non-malleable commitments
• Round optimal concurrent non-malleability from polynomial hardness
• Post-quantum multi-party computation
• Black-box non-interactive non-malleable commitments
• Secure quantum extraction protocols
• Non-interactive non-malleability from quantum supremacy
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• Concurrent Non-Malleable Commitments (and More) in 3 Rounds
• Quantum Proofs of Knowledge
• Black-Box Constructions of Composable Protocols without Set-Up
• Zero-knowledge against quantum attacks
• Fully Simulatable Quantum-Secure Coin-Flipping and Applications
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
• New and improved constructions of non-malleable cryptographic protocols
• Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
• Adaptive One-Way Functions and Applications
• Universal Arguments and their Applications
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Nonmalleable Cryptography
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
• Post-quantum zero knowledge in constant rounds
• A unified framework for concurrent security
• Non-malleability amplification
• Classical Cryptographic Protocols in a Quantum World
• A single quantum cannot be cloned
• Textbook non-malleable commitments
• Constant round non-malleable protocols using one way functions
• Constant-round non-malleable commitments from any one-way function
• Concurrent Non-malleable Commitments from Any One-Way Function
• Theory of Cryptography