Two Efficient Tag-Based Encryption Schemes on Lattices

DOI10.1007/978-3-319-89500-0_10zbMath1452.94088OpenAlexW2798225854MaRDI QIDQ3297485

Rui Xue, Biao Wang, Xueqing Wang

Publication date: 20 July 2020

Published in: Information and Communications Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89500-0_10

zbMATH Keywords

adaptive securitytag-based encryptionDLWEG-trapdoorprobabilistic partitioning technique

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• 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
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• 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
• Public-key cryptosystems from the worst-case shortest vector problem
• Efficient Identity-Based Encryption Without Random Oracles
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• CCA Secure Public Key Encryption Scheme Based on LWE Without Gaussian Sampling
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: Two Efficient Tag-Based Encryption Schemes on Lattices