Wildcarded identity-based encryption from lattices

DOI10.1016/J.TCS.2021.12.007OpenAlexW4200093885WikidataQ122949963 ScholiaQ122949963MaRDI QIDQ2067630

Minh Thuy Truc Pham, Mei Jiang, Ngoc Ai Van Nguyen, Dung Hoang Duong, Willy Susilo

Publication date: 18 January 2022

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

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

zbMATH Keywords

wildcardstandard modellatticesidentity-based encryptionlearning with errors

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Computer security. 23rd European symposium on research in computer security, ESORICS 2018, Barcelona, Spain, September 3--7, 2018. Proceedings. Part II
• Wildcarded identity-based encryption
• Identity-Based Cryptosystems and Signature Schemes
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Identity-Based Encryption Gone Wild
• Hierarchical ID-Based Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Generating Shorter Bases for Hard Random Lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Wildcarded identity-based encryption from lattices