Transciphering framework for approximate homomorphic encryption
From MaRDI portal
Recommendations
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Approximate homomorphic encryption with reduced approximation error
- A full RNS variant of approximate homomorphic encryption
- Homomorphic encryption for arithmetic of approximate numbers
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A comparison of the homomorphic encryption schemes FV and YASHE
- An inequality for Hilbert series of graded algebras.
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Ciphers for MPC and FHE
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Fully homomorphic encryption using ideal lattices
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Higher-Order Cryptanalysis of LowMC
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- Improved filter permutators for efficient FHE: better instances and implementations
- Linear Cryptanalysis of Non Binary Ciphers
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Optimized interpolation attacks on lowMC
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- TFHE: fast fully homomorphic encryption over the torus
- The interpolation attack on block ciphers
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead
Cited in
(21)- A bitwise logistic regression using binary approximation and real number division in homomorphic encryption scheme
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- Discretization error reduction for high precision torus fully homomorphic encryption
- BLEACH: cleaning errors in discrete computations over CKKS
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
- Coefficient grouping for complex affine layers
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
- Generalized Feistel ciphers for efficient prime field masking
- Security analysis of the P-SPN structure with a class of linear layer matrix against invariant subspace attack
- Modelling ciphers with overdefined systems of quadratic equations: application to Friday, Vision, RAIN and Biscuit
- Minimize the randomness in Rasta-like designs: how far can we go? Application to \textsc{Pasta}
- TooLIP: how to find new instances of FiLIP cipher with smaller key size and new filters
- Tracking algebraic degree with exponent sets: higher-order differential attacks on FHE-friendly cipher \({\mathsf{Yu}_2\mathsf{X}}\)
- DuX: a block cipher for efficient FHE evaluation
- Towards practical transciphering for FHE with setup independent of the plaintext space
- Revisiting the slot-to-coefficient transformation for BGV and BFV
This page was built for publication: Transciphering framework for approximate homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157566)
