Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more

DOI10.1016/J.TCS.2020.10.010zbMATH Open1467.94041OpenAlexW3093377501WikidataQ123000320 ScholiaQ123000320MaRDI QIDQ2215969FDOQ2215969

Authors: Atsushi Takayasu, Yodai Watanabe 

Publication date: 15 December 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.010

Recommendations

• Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
• Revocable Identity-Based Encryption from Lattices
• Server-aided revocable identity-based encryption from lattices
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• Revocable identity-based encryption revisited: security model and construction
• Generic constructions of revocable identity-based encryption
• Simplified server-aided revocable identity-based encryption from lattices
• Simplified revocable hierarchical identity-based encryption from lattices
• CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance

zbMATH Keywords

lattice-based cryptographyanonymitydual system encryptionrevocable identity-based encryptionkey exposure resistance

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Public-key cryptosystems from the worst-case shortest vector problem
• On lattices, learning with errors, random linear codes, and cryptography
• An Introduction to Computational Physics
• Efficient revocable identity-based encryption via subset difference methods
• Identity-based cryptosystems and signature schemes
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Trapdoors for hard lattices and new cryptographic constructions
• Efficient lattice (H)IBE in the standard model
• Adaptive-ID Secure Revocable Identity-Based Encryption
• Title not available (Why is that?)
• Identity-Based Encryption from the Weil Pairing
• Title not available (Why is that?)
• Efficient Identity-Based Encryption Without Random Oracles
• Fuzzy Identity-Based Encryption
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
• Efficient selective identity-based encryption without random oracles
• Classical hardness of learning with errors
• Title not available (Why is that?)
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
• Families of finite sets in which no set is covered by the union of \(r\) others
• Topics in Cryptology – CT-RSA 2004
• Revocable identity-based encryption from the computational Diffie-Hellman problem
• Generating shorter bases for hard random lattices
• Bonsai trees, or how to delegate a lattice basis
• Title not available (Why is that?)
• Revocable Identity-Based Encryption from Lattices
• Towards tightly secure lattice short signature and id-based encryption
• Functional encryption for threshold functions (or fuzzy IBE) from lattices
• Revocable hierarchical identity-based encryption via history-free approach
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
• Adaptive-ID secure revocable hierarchical identity-based encryption
• Server-aided revocable identity-based encryption from lattices
• Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
• Revocable hierarchical identity-based encryption with shorter private keys and update keys
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
• Efficient (anonymous) compact HIBE from standard assumptions
• On the untapped potential of encoding predicates by arithmetic circuits and their applications
• Simplified revocable hierarchical identity-based encryption from lattices
• Bounded-collusion IBE from key homomorphism
• Revocable identity-based encryption from codes with rank metric
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• Constructions of CCA-Secure Revocable Identity-Based Encryption

Cited In (12)

• Revocable Identity-Based Encryption from Lattices
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
• Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
• Server-aided revocable identity-based encryption from lattices
• Revocable identity-based encryption revisited: security model and construction
• Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
• Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
• Simplified revocable hierarchical identity-based encryption from lattices
• Revocable IBE with En-DKER from lattices: a novel approach for lattice basis delegation
• Constructions of CCA-Secure Revocable Identity-Based Encryption

This page was built for publication: Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more

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