New lattice based cryptographic constructions
From MaRDI portal
Publication:3581301
DOI10.1145/780542.780603zbMath1192.94105arXivcs/0309051OpenAlexW2015281423MaRDI QIDQ3581301
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0309051
Related Items (14)
How to meet ternary LWE keys ⋮ Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Improved broadcast attacks against subset sum problems via lattice oracle ⋮ The hunting of the SNARK ⋮ Unnamed Item ⋮ Using quantum key distribution for cryptographic purposes: a survey ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ The Complexity of Public-Key Cryptography ⋮ Quantum key search for ternary LWE
This page was built for publication: New lattice based cryptographic constructions
