Homomorphic evaluation of the AES circuit
From MaRDI portal
Recommendations
Cited in
(97)- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Bootstrapping for approximate homomorphic encryption
- Modular hardware architecture for somewhat homomorphic function evaluation
- Fixed-point arithmetic in SHE schemes
- A full RNS variant of approximate homomorphic encryption
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- CRT-based fully homomorphic encryption over the integers
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- On the security of homomorphic encryption on approximate numbers
- Actively secure setup for SPDZ
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Improving the efficiency of AES protocols in multi-party computation
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Approximate homomorphic encryption with reduced approximation error
- FASTA -- a stream cipher for fast FHE evaluation
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Homomorphically encrypted k-means on cloud-hosted servers with low client-side load
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Multi-user security bound for filter permutators in the random oracle model
- Fully homomorphic SIMD operations
- Bootstrapping for helib
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- Bootstrapping for BGV and BFV revisited
- Homomorphic evaluation requires depth
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Accelerating homomorphic computations on rational numbers
- FHE circuit privacy almost for free
- Cryptanalysis of the FLIP family of stream ciphers
- Polly cracker, revisited
- On the homomorphic computation of symmetric cryptographic primitives
- 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
- Enhancing data parallelism of fully homomorphic encryption
- Homomorphic AES evaluation using the modified LTV scheme
- Blending FHE-NTRU keys -- the excalibur property
- Secure statistical analysis using RLWE-based homomorphic encryption
- Multikey fully homomorphic encryption and applications
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Packed ciphertexts in LWE-based homomorphic encryption
- Ring packing and amortized FHEW bootstrapping
- Homomorphic encryption
- New ideas to build noise-free homomorphic cryptosystems
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE 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
- Faster homomorphic evaluation of discrete Fourier transforms
- 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
- Securing approximate homomorphic encryption using differential privacy
- Revisiting homomorphic encryption schemes for finite fields
- Transciphering framework for approximate homomorphic encryption
- Finding and evaluating parameters for BGV
- Coefficient grouping for complex affine layers
- Accelerating HE operations from key decomposition technique
- Faster secure multi-party computation of AES and DES using lookup tables
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Secure outsourced matrix multiplication with fully homomorphic encryption
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- On the precision loss in approximate homomorphic encryption
- Faster amortized FHEW bootstrapping using ring automorphisms
- Circuit bootstrapping: faster and smaller
- Hintless single-server private information retrieval
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
- Turtle wins rabbit again: faster modulus reduction for RNS-CKKS
- \texttt{Transistor}: a TFHE-friendly stream cipher
- Fast private set intersection from polynomial multiplication triples
- Fully homomorphic encryption for cyclotomic prime moduli
- Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields
- More efficient functional bootstrapping for general functions in polynomial modulus
- Revisiting key decomposition techniques for FHE: simpler, faster and more generic
- Minimize the randomness in Rasta-like designs: how far can we go? Application to \textsc{Pasta}
- Towards practical doubly-efficient private information retrieval
- CRT representation of LWE based TFHE
- Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
- TooLIP: how to find new instances of FiLIP cipher with smaller key size and new filters
- Correction to: ``Actively secure setup for SPDZ
- Accelerating TFHE with sorted bootstrapping techniques
- Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
- Leveled homomorphic encryption schemes for homomorphic encryption standard
- DuX: a block cipher for efficient FHE evaluation
- A central limit approach for ring-LWE noise analysis
- PETCHA: post-quantum efficient transciphering with ChaCha
- On circuit private, multikey and threshold approximate homomorphic encryption
- Designs for practical SHE schemes based on Ring-LWR
- HRA-secure homomorphic lattice-based proxy re-encryption with tight security
- Blind zkSNARKs for private proof delegation and verifiable computation over encrypted data
- Faster bootstrapping for CKKS with less modulus consumption
- A sub-linear lattice-based submatrix commitment scheme
- Secret computation of purchase history data using somewhat homomorphic encryption
- (Leveled) fully homomorphic encryption without bootstrapping
This page was built for publication: Homomorphic evaluation of the AES circuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914304)
