Homomorphic AES evaluation using the modified LTV scheme

DOI10.1007/S10623-015-0095-1zbMath1402.94055OpenAlexW2206887593WikidataQ123268464 ScholiaQ123268464MaRDI QIDQ310240

Yin Hu, Berk Sunar, Yarkın Doröz

Publication date: 8 September 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0095-1

zbMATH Keywords

AESfully homomorphic encryptionNTRUring-LWE

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Cryptanalysis of the FLIP Family of Stream Ciphers

Uses Software

• NTL
• HElib
• BKZ
• NTRU
• GitHub

Cites Work

• Unnamed Item
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Fully homomorphic SIMD operations
• Fast multiplication of large numbers
• (Leveled) fully homomorphic encryption without bootstrapping
• On the Homomorphic Computation of Symmetric Cryptographic Primitives
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Estimating Key Sizes for High Dimensional Lattice-Based Systems
• Fully Homomorphic Encryption with Polylog Overhead
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• A Very Compact S-Box for AES
• On Ideal Lattices and Learning with Errors over Rings
• Lattice-based Cryptography
• A Comparison of the Homomorphic Encryption Schemes FV and YASHE
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Predicting Lattice Reduction

This page was built for publication: Homomorphic AES evaluation using the modified LTV scheme