Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes

DOI10.1007/978-3-319-42634-1_22zbMath1394.94931OpenAlexW2499196160MaRDI QIDQ2817869

Benjamin Hadjibeyli, Paul Kirchner, Pierre-Alain Fouque

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_22

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Privacy-Preserving Prescription Drug Management Using Fully Homomorphic Encryption ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges

Uses Software

• ring-LWE

Cites Work

• Unnamed Item
• Worst-case to average-case reductions for module lattices
• Optimized Interpolation Attacks on LowMC
• Higher-Order Cryptanalysis of LowMC
• Learning with Rounding, Revisited
• On the Homomorphic Computation of Symmetric Cryptographic Primitives
• Pseudorandom Functions and Lattices
• Homomorphic Evaluation of the AES Circuit
• Better Algorithms for LWE and LWR
• Ciphers for MPC and FHE
• New Algorithms for Learning in Presence of Errors
• How to Encrypt with the LPN Problem
• Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
• Cryptographic Hardness of Random Local Functions–Survey
• A Toolkit for Ring-LWE Cryptography
• Batch Fully Homomorphic Encryption over the Integers
• A Comparison of the Homomorphic Encryption Schemes FV and YASHE
• Fully homomorphic encryption using ideal lattices
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes