An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption

DOI10.1016/j.camwa.2012.02.030zbMath1364.94569OpenAlexW2041602336WikidataQ121793409 ScholiaQ121793409MaRDI QIDQ2629405

Li-qiang Wu, Xiaofeng Chen, Min-qing Zhang, Xiao-Yuan Yang

Publication date: 6 July 2016

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2012.02.030

zbMATH Keywords

ideal latticepublic-key encryptionidentity-based encryptionchosen-ciphertext security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

STP-LWE: A variant of learning with error for a flexible encryption

Cites Work

• Unnamed Item
• Probabilistic encryption
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Lossy trapdoor functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Efficient Lattice (H)IBE in the Standard Model
• Generalized Compact Knapsacks Are Collision Resistant
• Efficient Public Key Encryption Based on Ideal Lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Advances in Cryptology - EUROCRYPT 2004
• Asymptotically Efficient Lattice-Based Digital Signatures
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption