Fully homomorphic encryption with relatively small key and ciphertext sizes
From MaRDI portal
(Redirected from Publication:3562913)
Recommendations
Cited in
(74)- On CCA-Secure Somewhat Homomorphic Encryption
- Unsupervised Machine Learning on encrypted data
- Adaptive security, erasures, and network assumptions in communication-local MPC
- TFHE: fast fully homomorphic encryption over the torus
- Fully homomorphic encryption over the integers with shorter public keys
- Generating subgroups of ray class groups with small prime ideals
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- FHE circuit privacy almost for free
- Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme
- Encrypted data processing with homomorphic re-encryption
- Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme
- Experiments with the plaintext space in Gentry's somewhat homomorphic scheme
- The geometry of lattice cryptography
- Computing primitive idempotents in finite commutative rings and applications
- Polly cracker, revisited
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Computing on authenticated data
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- CRT-based fully homomorphic encryption over the integers
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)
- Deniable fully homomorphic encryption from learning with errors
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail
- Short principal ideal problem in multicubic fields
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- Security analysis of cryptosystems using short generators over ideal lattices
- Benaloh's dense probabilistic encryption revisited
- Fully homomorphic encryption for point numbers
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Secure outsourced computation
- An algorithm for solving the principal ideal problem with subfields
- Some security bounds for the key sizes of DGHV scheme
- Verifiable Decryption for Fully Homomorphic Encryption
- Lattice Reduction for Modular Knapsack
- Cryptanalysis of a homomorphic encryption scheme
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- Efficient Hidden Vector Encryption with Constant-Size Ciphertext
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Fully homomorphic encryption scheme and Fermat’s little theorem
- Subexponential class group and unit group computation in large degree number fields
- Short generators without quantum computers: the case of multiquadratics
- Short Stickelberger class relations and application to Ideal-SVP
- CCA-secure keyed-fully homomorphic encryption
- Fast blind rotation for bootstrapping FHEs
- Subexponential time relations in the class group of large degree number fields
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Cryptographic algorithms for privacy-preserving online applications
- Boosting verifiable computation on encrypted data
- On the ideal shortest vector problem over random rational primes
- A novel fully homomorphic encryption scheme bsed on LWE
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Homomorphic encryption
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Cryptanalysis of a homomorphic encryption scheme over integers
- A symmetric key fully homomorphic encryption scheme using general Chinese remainder theorem
- FPTRU: optimization of NTRU-prime and TLS performance assessment
- Breaking the FF3 format-preserving encryption standard over small domains
- TinyLabels: how to compress garbled circuit input labels, efficiently
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Multikey fully homomorphic encryption and applications
- Fully homomorphic encryption in real world applications
- Geometry of biquadratic and cyclic cubic log-unit lattices
- Unit reducible fields and perfect unary forms. II. Cyclotomic fields
- Accelerating homomorphic computations on rational numbers
- Fully homomorphic SIMD operations
- On constructing homomorphic encryption schemes from coding theory
- Practical private-key fully homomorphic encryption in rings
- Secure outsourced matrix multiplication with fully homomorphic encryption
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
This page was built for publication: Fully homomorphic encryption with relatively small key and ciphertext sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562913)
