Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
From MaRDI portal
Publication:3003372
DOI10.1007/978-3-642-20465-4_4zbMath1281.94057OpenAlexW1936753088MaRDI QIDQ3003372
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_4
Related Items (61)
How to meet ternary LWE keys ⋮ Lattice-based certificateless encryption scheme ⋮ An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ Tightly secure signatures from lossy identification schemes ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Provably Weak Instances of Ring-LWE ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Application of automorphic forms to lattice problems ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ Private Computation on Encrypted Genomic Data ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ A signature scheme from the finite field isomorphism problem ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Characterizing overstretched NTRU attacks ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Shorter hash-and-sign lattice-based signatures ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Identity-based interactive aggregate signatures from lattices ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ On the hardness of the NTRU problem ⋮ Efficient lattice-based inner-product functional encryption ⋮ Quantum rewinding for many-round protocols ⋮ Security considerations for Galois non-dual RLWE families ⋮ Lattice-based cryptography: a survey ⋮ Subfield algorithms for ideal- and module-SVP based on the decomposition group ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Choosing Parameters for NTRUEncrypt ⋮ On the geometry of cyclic lattices ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU ⋮ A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys ⋮ ETRU: NTRU over the Eisenstein integers ⋮ A public-key encryption scheme based on non-linear indeterminate equations ⋮ NTRU prime: reducing attack surface at low cost ⋮ Vulnerable public keys in NTRU cryptosystem ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Towards a ring analogue of the leftover hash lemma ⋮ Post-Quantum Cryptography: State of the Art ⋮ Integer Version of Ring-LWE and Its Applications ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ On the ideal shortest vector problem over random rational primes ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ LWE from non-commutative group rings ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Worst-case to average-case reductions for module lattices
Uses Software
This page was built for publication: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
