Fully homomorphic encryption with relatively small key and ciphertext sizes

DOI10.1007/978-3-642-13013-7_25zbMATH Open1281.94055DBLPconf/pkc/SmartV10OpenAlexW1575598731WikidataQ28002578 ScholiaQ28002578MaRDI QIDQ3562913FDOQ3562913

Frederik Vercauteren, N. P. Smart

Publication date: 28 May 2010

Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_25

Recommendations

• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Faster fully homomorphic encryption
• Fully homomorphic encryption using ideal lattices

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (61)

• Generating subgroups of ray class groups with small prime ideals
• Computing primitive idempotents in finite commutative rings and applications
• $$\mathsf {HIKE}$$ : Walking the Privacy Trail
• Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
• An algorithm for solving the principal ideal problem with subfields
• Fast blind rotation for bootstrapping FHEs
• Secure outsourced matrix multiplication with fully homomorphic encryption
• Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme
• On CCA-Secure Somewhat Homomorphic Encryption
• Unsupervised Machine Learning on encrypted data
• TFHE: fast fully homomorphic encryption over the torus
• Accelerating Homomorphic Computations on Rational Numbers
• Group homomorphic encryption: characterizations, impossibility results, and applications
• Encrypted data processing with homomorphic re-encryption
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• On Constructing Homomorphic Encryption Schemes from Coding Theory
• Polly cracker, revisited
• Homomorphic Encryption
• Short Generators Without Quantum Computers: The Case of Multiquadratics
• Short Stickelberger Class Relations and Application to Ideal-SVP
• Computing on authenticated data
• Benaloh’s Dense Probabilistic Encryption Revisited
• Multikey Fully Homomorphic Encryption and Applications
• 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
• Short principal ideal problem in multicubic fields
• FHE Circuit Privacy Almost for Free
• Security analysis of cryptosystems using short generators over ideal lattices
• Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes
• Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
• Verifiable Decryption for Fully Homomorphic Encryption
• Some security bounds for the key sizes of DGHV scheme
• Lattice Reduction for Modular Knapsack
• Cryptanalysis of a homomorphic encryption scheme
• Efficient Hidden Vector Encryption with Constant-Size Ciphertext
• Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
• The Geometry of Lattice Cryptography
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• Subexponential class group and unit group computation in large degree number fields
• 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
• Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms
• Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
• Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
• Cryptographic algorithms for privacy-preserving online applications
• A novel fully homomorphic encryption scheme bsed on LWE
• Boosting verifiable computation on encrypted data
• On the ideal shortest vector problem over random rational primes
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Secure Outsourced Computation
• Breaking the FF3 format-preserving encryption standard over small domains
• CCA-Secure Keyed-Fully Homomorphic Encryption
• Fully homomorphic encryption in real world applications
• Geometry of biquadratic and cyclic cubic log-unit lattices
• Fully homomorphic SIMD operations
• On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes
• Cryptanalysis of a Homomorphic Encryption Scheme Over Integers
• Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
• Computing Generator in Cyclotomic Integer Rings
• On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols

Uses Software

• NTRU

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)