Augmented Learning with Errors: The Untapped Potential of the Error Term
From MaRDI portal
Publication:2948191
DOI10.1007/978-3-662-47854-7_20zbMath1415.94427OpenAlexW2224936159MaRDI QIDQ2948191
Rachid El Bansarkhani, Özgür Dagdelen, Johannes A. Buchmann
Publication date: 29 September 2015
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47854-7_20
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- (Leveled) fully homomorphic encryption without bootstrapping
- Hardness of SIS and LWE with Small Parameters
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice Cryptography for the Internet
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- SWIFFT: A Modest Proposal for FFT Hashing
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
- A Framework for Efficient and Composable Oblivious Transfer
- Rerandomizable RCCA Encryption
- Efficient Public Key Encryption Based on Ideal Lattices
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- Nonmalleable Cryptography
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Lossy Codes and a New Variant of the Learning-With-Errors Problem
- A Toolkit for Ring-LWE Cryptography
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Advances in Cryptology - EUROCRYPT 2004
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- New lattice-based cryptographic constructions
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Classical hardness of learning with errors
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Theory of Cryptography
This page was built for publication: Augmented Learning with Errors: The Untapped Potential of the Error Term
