Efficient Identity-Based Encryption over NTRU Lattices
From MaRDI portal
Publication:2936597
DOI10.1007/978-3-662-45608-8_2zbMath1317.94103OpenAlexW62933689MaRDI QIDQ2936597
Léo Ducas, Vadim Lyubashevsky, Thomas Prest
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_2
Related Items (45)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Isochronous Gaussian Sampling: From Inception to Implementation ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ Survey of information security ⋮ Gadget-based iNTRU lattice trapdoors ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Scalable revocable identity-based signature over lattices in the standard model ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ LMCLAEKS: LWE-assisted multi-recipient certificateless authenticated encryption with keyword search ⋮ Improved power analysis attacks on Falcon ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Shorter hash-and-sign lattice-based signatures ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ A framework for practical anonymous credentials from lattices ⋮ Lattice-based inner product argument ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ Lattice-based programmable hash functions and applications ⋮ A full RNS variant of FV like somewhat homomorphic encryption schemes ⋮ Lattice-based cryptography: a survey ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors ⋮ Identity-Based Blind Signature from Lattices in Standard Model ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ One-Shot Verifiable Encryption from Lattices ⋮ A framework for cryptographic problems from linear algebra ⋮ Modular lattice signatures, revisited ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Algorithms for the Generalized NTRU Equations and their Storage Analysis ⋮ Lattice-based revocable certificateless signature ⋮ Unnamed Item ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Implementation of lattice trapdoors on modules and applications ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
This page was built for publication: Efficient Identity-Based Encryption over NTRU Lattices
