Signatures with memory-tight security in the quantum random oracle model

DOI10.1007/978-3-031-58754-2_2MaRDI QIDQ6637714

Keita Xagawa

Publication date: 13 November 2024

zbMATH Keywords

signatureprovable securitypost-quantum cryptographyblind unforgeabilitymemory-tight reductionsplus-one unforgeabilityquantum random oracle model (QROM)

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tightly secure signatures from lossy identification schemes
• Another look at ``provable security
• The random oracle model: a twenty-year retrospective
• Memory lower bounds of reductions revisited
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• Memory-tight reductions
• Tight time-space lower bounds for finding multiple collision pairs and their applications
• Quantum-access-secure message authentication via blind-unforgeability
• The memory-tightness of authenticated encryption
• On the memory-tightness of hashed ElGamal
• Compact ring signatures from learning with errors
• Hiding in plain sight: memory-tight proofs via randomness programming
• Quantum security proofs using semi-classical oracles
• Another look at tightness. II: Practical issues in cryptography
• Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Another Look at Tightness
• Tightly-Secure Signatures from Lossy Identification Schemes
• From Identification to Signatures, Tightly: A Framework and Generic Transforms
• Random Oracles in a Quantum World
• Trapdoors for hard lattices and new cryptographic constructions
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A method for obtaining digital signatures and public-key cryptosystems
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• A note on the post-quantum security of (ring) signatures
• Memory-tight multi-challenge security of public-key encryption
• Tight adaptive reprogramming in the QROM
• A detailed analysis of Fiat-Shamir with aborts
• Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium
• Quantum-access security of hash-based signature schemes
• G+G: a Fiat-Shamir lattice signature based on convolved Gaussians

This page was built for publication: Signatures with memory-tight security in the quantum random oracle model

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