GGHLite: More Efficient Multilinear Maps from Ideal Lattices
From MaRDI portal
Publication:5418699
DOI10.1007/978-3-642-55220-5_14zbMath1332.94071OpenAlexW130353434MaRDI QIDQ5418699
Damien Stehlé, Ron Steinfeld, Adeline Roux-Langlois
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_14
Related Items
A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties, Constructions for quantum indistinguishability obfuscation, Cryptanalysis of multilinear maps from ideal lattices: revisited, On the hardness of module learning with errors with short distributions, Hardness of \(k\)-LWE and applications in traitor tracing, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, A polynomial time algorithm for breaking NTRU encryption with multiple keys, Lattice-based succinct arguments for NP with polylogarithmic-time verification, On the hardness of the NTRU problem, Bit security as computational cost for winning games with high probability, Generating subgroups of ray class groups with small prime ideals, A full RNS variant of FV like somewhat homomorphic encryption schemes, Hardness of (M)LWE with semi-uniform seeds, Towards classical hardness of module-LWE: the linear rank case, An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero, Practical Order-Revealing Encryption with Limited Leakage, Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance, Security analysis of cryptosystems using short generators over ideal lattices, Provably Secure NTRU Instances over Prime Cyclotomic Rings, Computing Generator in Cyclotomic Integer Rings, Short Stickelberger Class Relations and Application to Ideal-SVP, On the Hardness of Learning with Rounding over Small Modulus, How to build time-lock encryption, On the integer polynomial learning with errors problem, A Subfield Lattice Attack on Overstretched NTRU Assumptions, On the robustness of randomized classifiers to adversarial examples
Uses Software
