当前位置: X-MOL 学术Secur. Commun. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Two-Party Secure Computation for Any Polynomial Function on Ciphertexts under Different Secret Keys
Security and Communication Networks Pub Date : 2021-02-22 , DOI: 10.1155/2021/6695304
Bingbing Jiang 1
Affiliation  

Multikey fully homomorphic encryption proposed by Lopez-Alt et al. (STOC12) is a significant primitive that allows one to perform computation on the ciphertexts encrypted by multiple different keys independently. Then, several schemes were constructed based on decisional small polynomial ratio or learning with errors. These schemes all require an expansion algorithm to transform a ciphertext under a single key into an encryption of the same message under a set of keys. To achieve the expansion algorithm without interaction with these key-keepers, their encryption algorithm not only outputs a ciphertext of a plaintext but also exports auxiliary information generated from the randomness used in the former encryption process. Beyond that, the size of the ciphertext encrypted by multiple keys increases linearly or quadratically in the number of participants. In this paper, we studied the problem whether someone can directly perform arbitrary computation on ciphertexts encrypted by different keys without any auxiliary information in the output of the encryption algorithm and an increase in the size of the ciphertext in the expansion algorithm. To this end, we proposed a novel and simple scheme of secure computation on ciphertexts under two different keys directly without any auxiliary information. In other words, each party just provides its own ciphertexts encrypted by the GSW scheme (CRYPTO13). In the procedure of executing evaluation on these ciphertexts, the size of the new ciphertext remains the same as that of the GSW ciphertext.

中文翻译:

不同密钥下密文上任何多项式函数的两方安全计算

Lopez-Alt等人提出的多密钥完全同态加密。(STOC12)是一种重要的原语,它允许人们对由多个不同密钥加密的密文分别执行计算。然后,基于决策的小多项式比率或有错误的学习,构造了几种方案。这些方案都需要扩展算法,以将单个密钥下的密文转换为一组密钥下相同消息的加密。为了在不与这些密钥管理者交互的情况下实现扩展算法,他们的加密算法不仅输出明文的密文,而且还导出由先前加密过程中使用的随机性生成的辅助信息。除此之外,通过多个密钥加密的密文的大小,参与者的数量呈线性或二次方增长。在本文中,我们研究了在加密算法的输出中是否有人可以在没有任何辅助信息的情况下直接对由不同密钥加密的密文进行任意计算以及扩展算法中密文大小增加的问题。为此,我们提出了一种新颖,简单的直接在两个不同密钥下无需任何辅助信息的情况下对密文进行安全计算的方案。换句话说,各方仅提供由GSW方案(CRYPTO13)加密的自己的密文。在对这些密文执行评估的过程中,新密文的大小与GSW密文的大小相同。我们研究了这样一个问题,即有人是否可以直接对由不同密钥加密的密文进行任意计算,而无需在加密算法的输出中提供任何辅助信息,并且在扩展算法中密文的大小会增加。为此,我们提出了一种新颖,简单的直接在两个不同密钥下无需任何辅助信息的情况下对密文进行安全计算的方案。换句话说,各方仅提供由GSW方案(CRYPTO13)加密的自己的密文。在对这些密文执行评估的过程中,新密文的大小与GSW密文的大小相同。我们研究了这样一个问题,即有人是否可以直接对由不同密钥加密的密文进行任意计算,而无需在加密算法的输出中提供任何辅助信息,并且在扩展算法中密文的大小会增加。为此,我们提出了一种新颖,简单的直接在两个不同密钥下无需任何辅助信息的情况下对密文进行安全计算的方案。换句话说,各方仅提供由GSW方案(CRYPTO13)加密的自己的密文。在对这些密文执行评估的过程中,新密文的大小与GSW密文的大小相同。
更新日期:2021-02-22
down
wechat
bug