Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Dianzi Ke-ji Daxue xuebao

A Secure Computation Scheme of Inner Product Based on Fully Homomorphic Encryption

Deng Jiang, XU Chun-xiang, Yang Hao-miao

Published Jan 1, 2016• 0 citations
OpenAlex

Related papers

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

Joppe W. Bos, Kristin Lauter, Jake Loftus +1 more

Lecture notes in computer science•Jan 1, 2013•439 citations

Strongly full-hiding inner product encryption

Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay

Theoretical Computer Science•Jan 4, 2017•8 citations

An efficient multi-key BFV fully homomorphic encryption scheme with optimized relinearization

Sai Hu, Ruwei Huang, Liang Zhou

Abstract Traditional fully homomorphic encryption(FHE) schemes allow computation only on data encrypted under the same public key. Multi-Key Fully Homomorphic Encryption (MKFHE) enables arbitrary operations on data encrypted with different public keys, allowing all participating users jointly decrypting the final ciphertext. The multi-key BFV FHE scheme inherits BFV’s advantages in ring element encryption and scale invariance. Nonetheless, it also has some disadvantages, such as additional noise generated during the relinearization process, the need for costly transformations during the external product process, and the requirement for a Common Reference String (CRS). In this paper, we investigate the MKFHE scheme for RLWE-based BFV. Firstly, we improve the modulus size of the evaluation key and the public key to construct a modulus enchancement relinearization method, which can significantly reduce the noise generated during the relinearization process. Secondly, we propose to use an inner product via Gadget decomposition in the relinearization based on the MK-BFV scheme instead of the original outer product operation, which can reduce the complexity of the NTT operation to $$\left( {d + 2\tilde{d}} \right)r^{\prime } /\left( {d + 2} \right)\tilde{l}$$ d + 2 d ~ r ′ / d + 2 l ~ of the original one. Finally, we propose a MK-BFV without CRS on the basis of the previous ones, which enhances the user's control over his own key.

Cybersecurity•Jun 26, 2025•4 citations

Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p

Guilhem Castagnos, Fabien Laguillaumie, Ida Tucker

Lecture notes in computer science•Jan 1, 2018•79 citations

Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}.

Carlos Aguilar Melchor, Slim Bettaieb, Philippe Gaborit +1 more

Abstract. In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a security reduction from LWE over general lattices. General lattices (as opposed to ideal lattices) do not have an inherent multiplicative structure but, using a tensorial product, Aguilar et al. managed to obtain a scheme allowing to compute products with a polylogarithmic amount of operands. In this paper we present an alternative construction allowing to compute products with polynomiallymany operands while preserving the security reductions of the initial scheme. Unfortunately, despite this improvement our construction seems to be incompatible with Gentry’s seminal transformation allowing to obtain fully-homomorphic encryption schemes. Recently, Brakerski et al. used the tensorial product approach introduced by Aguilar et al. in a new alternative way which allows to radically improve the performance of the obtained scheme. Based on this approach, and using two nice optimizations, their scheme is able to evaluate products with exponentially-many operands and can be transformed into an efficient fully-homomorphic encryption scheme while being based on general lattice problems. However, even if these results outperform the construction presented here, we believe the modifications we suggest for Aguilar et al.’s schemes are of independent interest.

•Jan 1, 2011•5 citations

Analysis of quantum fully homomorphic encryption schemes (QFHE) and hierarchial memory management for QFHE

Shreya Girish Savadatti, Aswani Kumar Cherukuri, Annapurna Jonnalagadda +1 more

Homomorphic encryption is a recent and fundamental breakthrough in modern cryptography, which allows the performance of operations on encrypted data without unveiling the data. Leveraging quantum mechanics principles, quantum computers can potentially solve certain computational problems exponentially faster than classical computers. This immense computational power offers new possibilities for various fields, including cryptography. The rapid evolution of both these fields has led to the development of quantum fully homomorphic encryption (QFHE), which makes the capabilities of classical HE extend into the quantum domain. However, many existing QFHE schemes require significant memory due to complex calculations and fault-tolerance needs. This paper contributes in two ways. First, we provide a comprehensive survey of two specific QFHE schemes, discussing their underlying principles, mathematical frameworks, security aspects, and practical applications. We also explore the challenges posed by quantum computing and how QFHE addresses these to achieve both security and computational efficiency. Second, we propose a new hierarchical memory management system for QFHE, which includes a “quantum cache” (a specialized memory storage for quantum data) and a “reinforcement learning agent” (an intelligent system that learns from experience to optimize decisions). This system dynamically manages data movement between the cache and classical memory, improving memory efficiency and potentially boosting computational performance.

Complex & Intelligent Systems•Apr 23, 2025•15 citations
Abstract Traditional fully homomorphic encryption(FHE) schemes allow computation only on data encrypted under the same public key. Multi-Key Fully Homomorphic Encryption (MKFHE) enables arbitrary operations on data encrypted with different public keys, allowing all participating users jointly decrypting the final ciphertext. The multi-key BFV FHE scheme inherits BFV’s advantages in ring element encryption and scale invariance. Nonetheless, it also has some disadvantages, such as additional noise generated during the relinearization process, the need for costly transformations during the external product process, and the requirement for a Common Reference String (CRS). In this paper, we investigate the MKFHE scheme for RLWE-based BFV. Firstly, we improve the modulus size of the evaluation key and the public key to construct a modulus enchancement relinearization method, which can significantly reduce the noise generated during the relinearization process. Secondly, we propose to use an inner product via Gadget decomposition in the relinearization based on the MK-BFV scheme instead of the original outer product operation, which can reduce the complexity of the NTT operation to (d+2d~)r′/(d+2)l~\left( {d + 2\tilde{d}} \right)r^{\prime } /\left( {d + 2} \right)\tilde{l}(d+2d~)r′/(d+2)l~ d + 2 d ~ r ′ / d + 2 l ~ of the original one. Finally, we propose a MK-BFV without CRS on the basis of the previous ones, which enhances the user's control over his own key.
Abstract. In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a security reduction from LWE over general lattices. General lattices (as opposed to ideal lattices) do not have an inherent multiplicative structure but, using a tensorial product, Aguilar et al. managed to obtain a scheme allowing to compute products with a polylogarithmic amount of operands. In this paper we present an alternative construction allowing to compute products with polynomiallymany operands while preserving the security reductions of the initial scheme. Unfortunately, despite this improvement our construction seems to be incompatible with Gentry’s seminal transformation allowing to obtain fully-homomorphic encryption schemes. Recently, Brakerski et al. used the tensorial product approach introduced by Aguilar et al. in a new alternative way which allows to radically improve the performance of the obtained scheme. Based on this approach, and using two nice optimizations, their scheme is able to evaluate products with exponentially-many operands and can be transformed into an efficient fully-homomorphic encryption scheme while being based on general lattice problems. However, even if these results outperform the construction presented here, we believe the modifications we suggest for Aguilar et al.’s schemes are of independent interest.
Homomorphic encryption is a recent and fundamental breakthrough in modern cryptography, which allows the performance of operations on encrypted data without unveiling the data. Leveraging quantum mechanics principles, quantum computers can potentially solve certain computational problems exponentially faster than classical computers. This immense computational power offers new possibilities for various fields, including cryptography. The rapid evolution of both these fields has led to the development of quantum fully homomorphic encryption (QFHE), which makes the capabilities of classical HE extend into the quantum domain. However, many existing QFHE schemes require significant memory due to complex calculations and fault-tolerance needs. This paper contributes in two ways. First, we provide a comprehensive survey of two specific QFHE schemes, discussing their underlying principles, mathematical frameworks, security aspects, and practical applications. We also explore the challenges posed by quantum computing and how QFHE addresses these to achieve both security and computational efficiency. Second, we propose a new hierarchical memory management system for QFHE, which includes a “quantum cache” (a specialized memory storage for quantum data) and a “reinforcement learning agent” (an intelligent system that learns from experience to optimize decisions). This system dynamically manages data movement between the cache and classical memory, improving memory efficiency and potentially boosting computational performance.