D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
From MaRDI portal
Publication:2195452
DOI10.1016/j.ins.2018.01.037zbMath1440.94083OpenAlexW2789751194MaRDI QIDQ2195452
Hao Lei, Baocang Wang, Yu Pu Hu
Publication date: 8 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.01.037
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ETRU: NTRU over the Eisenstein integers
- Key recovery attacks against NTRU-based somewhat homomorphic encryption schemes
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model
- Efficient Identity-Based Encryption over NTRU Lattices
- On the Efficiency of Provably Secure NTRU
- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Blending FHE-NTRU Keys – The Excalibur Property
- SWIFFT: A Modest Proposal for FFT Hashing
- On Ideal Lattices and Learning with Errors over Rings
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A Survey of Public-Key Cryptosystems
- Fully homomorphic encryption using ideal lattices
- Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
- Speed Records for NTRU
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Advances in Cryptology - CRYPTO 2003
- Recovering NTRU Secret Key from Inversion Oracles
- Topics in Cryptology – CT-RSA 2005
- Provably Secure NTRU Instances over Prime Cyclotomic Rings
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- New Chosen-Ciphertext Attacks on NTRU
- Lattice-Based Cryptography
This page was built for publication: D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
