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

DOI10.1007/978-3-662-47854-7_20zbMATH Open1415.94427OpenAlexW2224936159MaRDI QIDQ2948191FDOQ2948191

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

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

zbMATH Keywords

encryptionlattice-based cryptographycomputational assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• SWIFFT: A Modest Proposal for FFT Hashing
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• On ideal lattices and learning with errors over rings
• 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
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• On lattices, learning with errors, random linear codes, and cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• 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
• Efficient public key encryption based on ideal lattices (extended abstract)
• Title not available (Why is that?)
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Nonmalleable Cryptography
• Classical hardness of learning with errors
• (Leveled) fully homomorphic encryption without bootstrapping
• Lattice signatures without trapdoors
• Better key sizes (and attacks) for LWE-based encryption
• A Framework for Efficient and Composable Oblivious Transfer
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Theory of Cryptography
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
• Lattice signatures and bimodal Gaussians
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Lossy trapdoor functions and their applications
• Smooth projective hashing and password-based authenticated key exchange from lattices
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• New lattice-based cryptographic constructions
• Augmented Learning with Errors: The Untapped Potential of the Error Term
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• A toolkit for ring-LWE cryptography
• Lattice cryptography for the internet
• Hardness of SIS and LWE with small parameters
• Lossy codes and a new variant of the learning-with-errors problem
• Rerandomizable RCCA Encryption
• Theory of Cryptography
• Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability

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)