Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity

DOI10.1007/s10623-021-00895-3zbMath1469.94116OpenAlexW3171244855MaRDI QIDQ2043417

Atsushi Takayasu

Publication date: 2 August 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-021-00895-3

zbMATH Keywords

anonymitylattice-based cryptographyadaptive securityquantum random oracle modeltight securityrevocable identity-based encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Simplified server-aided revocable identity-based encryption from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• Families of finite sets in which no set is covered by the union of \(r\) others
• Tightly-secure key-encapsulation mechanism in the quantum random oracle model
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• On the untapped potential of encoding predicates by arithmetic circuits and their applications
• Revocable identity-based encryption from the computational Diffie-Hellman problem
• Bonsai trees, or how to delegate a lattice basis
• Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
• Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
• Identity-based broadcast encryption with efficient revocation
• Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Revocable Identity-Based Encryption from Lattices
• Secure Identity-Based Encryption in the Quantum Random Oracle Model
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Identity-Based Cryptosystems and Signature Schemes
• New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
• Random Oracles in a Quantum World
• Simplified Revocable Hierarchical Identity-Based Encryption from Lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Efficient Lattice (H)IBE in the Standard Model
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Adaptive-ID Secure Revocable Identity-Based Encryption
• Revocable Identity-Based Encryption Revisited: Security Model and Construction
• Generic Constructions of Revocable Identity-Based Encryption
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• 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
• Tighter security proofs for GPV-IBE in the quantum random oracle model
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance

This page was built for publication: Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity