Homomorphic Evaluation of the AES Circuit
From MaRDI portal
Publication:2914304
DOI10.1007/978-3-642-32009-5_49zbMath1296.94117OpenAlexW2401959250MaRDI QIDQ2914304
Shai Halevi, Craig Gentry, Nigel P. Smart
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_49
Related Items (60)
Polly cracker, revisited ⋮ A sub-linear lattice-based submatrix commitment scheme ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Improving the efficiency of AES protocols in multi-party computation ⋮ Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ Approximate homomorphic encryption with reduced approximation error ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Bootstrapping for helib ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ FHEW with Efficient Multibit Bootstrapping ⋮ Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ Multi-user security bound for filter permutators in the random oracle model ⋮ Optimisations and tradeoffs for HElib ⋮ Parameter optimization and larger precision for (T)FHE ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Fixed-point arithmetic in SHE schemes ⋮ Finding and evaluating parameters for BGV ⋮ Coefficient grouping for complex affine layers ⋮ Accelerating HE operations from key decomposition technique ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ Bootstrapping for BGV and BFV revisited ⋮ Fully homomorphic SIMD operations ⋮ Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load ⋮ Enhancing Data Parallelism of Fully Homomorphic Encryption ⋮ A full RNS variant of approximate homomorphic encryption ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes ⋮ Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service ⋮ CRT-based fully homomorphic encryption over the integers ⋮ Packed Ciphertexts in LWE-Based Homomorphic Encryption ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys ⋮ On the security of homomorphic encryption on approximate numbers ⋮ Accelerating Homomorphic Computations on Rational Numbers ⋮ FHE Circuit Privacy Almost for Free ⋮ Cryptanalysis of the FLIP Family of Stream Ciphers ⋮ Actively secure setup for SPDZ ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation ⋮ Faster Homomorphic Evaluation of Discrete Fourier Transforms ⋮ Homomorphic Encryption ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
This page was built for publication: Homomorphic Evaluation of the AES Circuit