Tighter security proofs for GPV-IBE in the quantum random oracle model

DOI10.1007/s00145-020-09371-yzbMath1465.94073OpenAlexW2809884322WikidataQ113906159 ScholiaQ113906159MaRDI QIDQ5925501

Shuichi Katsumata, Takashi Yamakawa, Shota Yamada

Publication date: 7 April 2021

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-020-09371-y

zbMATH Keywords

identity-based encryptiontight security reductionLWE assumptionmulti-challenge securityquantum random oracle models

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Quantum key-length extension

Uses Software

• ring-LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
• A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
• Tightly-secure key-encapsulation mechanism in the quantum random oracle model
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• Almost tight multi-instance multi-ciphertext identity-based encryption on lattices
• Revisiting TESLA in the quantum random oracle model
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Succinct arguments in the quantum random oracle model
• Tighter proofs of CCA security in the quantum random oracle model
• Quantum random oracle model with auxiliary input
• Key encapsulation mechanism with explicit rejection in the quantum random oracle model
• Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
• (Tightly) QCCA-secure key-encapsulation mechanism in the quantum random oracle model
• How to record quantum queries, and applications to quantum indifferentiability
• Quantum security proofs using semi-classical oracles
• Revisiting post-quantum Fiat-Shamir
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Post-quantum security of Fiat-Shamir
• A Framework for Identity-Based Encryption with Almost Tight Security
• FHE Circuit Privacy Almost for Free
• Learning with Rounding, Revisited
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Quantum Position Verification in the Random Oracle Model
• Identity-Based (Lossy) Trapdoor Functions and Applications
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Tightly Secure Signatures and Public-Key Encryption
• Secure Identity-Based Encryption in the Quantum Random Oracle Model
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
• Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Random Oracles in a Quantum World
• Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Public-Key Encryption Schemes with Auxiliary Inputs
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Public-Key Encryption in the Bounded-Retrieval Model
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• An Efficient and Parallel Gaussian Sampler for Lattices
• Practical Identity-Based Encryption Without Random Oracles
• Computationally Sound Proofs
• A Toolkit for Ring-LWE Cryptography
• Learning with Errors over Rings
• Public-key cryptosystems from the worst-case shortest vector problem
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• An Improved Compression Technique for Signatures Based on Learning with Errors
• Revocable Quantum Timed-Release Encryption
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Classical hardness of learning with errors
• Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Tighter security proofs for GPV-IBE in the quantum random oracle model