Augmented Learning with Errors: The Untapped Potential of the Error Term

DOI10.1007/978-3-662-47854-7_20MaRDI QIDQ2948191zbMATH OpenOpenAlexFDO

Authors Rachid El Bansarkhani, Özgür Dagdelen, Johannes 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

zbMATH Keywords

encryptionlattice-based cryptographycomputational assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Learning with errors in the exponent
• New Algorithms for Learning in Presence of Errors
• Error learning behaviour and stability revisited
• Learning in the Presence of Malicious Errors
• Middle-product Learning with Errors
• Learning with errors and extrapolated dihedral cosets

Cites work

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 2079933 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A Framework for Efficient and Composable Oblivious Transfer
• A toolkit for ring-LWE cryptography
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Augmented Learning with Errors: The Untapped Potential of the Error Term
• Better key sizes (and attacks) for LWE-based encryption
• Bonsai trees, or how to delegate a lattice basis
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Classical hardness of learning with errors
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient lattice (H)IBE in the standard model
• Efficient public key encryption based on ideal lattices (extended abstract)
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption using ideal lattices
• Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
• Hardness of SIS and LWE with small parameters
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Lattice cryptography for the internet
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Lossy codes and a new variant of the learning-with-errors problem
• Lossy trapdoor functions and their applications
• New lattice-based cryptographic constructions
• Nonmalleable Cryptography
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Public-key cryptosystems from the worst-case shortest vector problem
• Rerandomizable RCCA Encryption
• SWIFFT: A Modest Proposal for FFT Hashing
• Smooth projective hashing and password-based authenticated key exchange from lattices
• Theory of Cryptography
• Theory of Cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(4)

• Augmented Learning with Errors: The Untapped Potential of the Error Term
• STP-LWE: A variant of learning with error for a flexible encryption
• Detecting and preventing error propagation via competitive learning
• LaPSuS -- a Lattice-based Private Stream aggregation scheme Under Scrutiny

This page was built for publication: Augmented Learning with Errors: The Untapped Potential of the Error Term

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948191)