为在密态计算中实现高效的比较操作,设计一种支持并行加速的多比特同态比较运算器。基于cuFHE软件库构造单比特同态数值比较器,在并行运算模式下调用该同态数值比较器,通过GPU硬件实现可比较任意比特明文的多比特同态比较运算器。利用cu...为在密态计算中实现高效的比较操作,设计一种支持并行加速的多比特同态比较运算器。基于cuFHE软件库构造单比特同态数值比较器,在并行运算模式下调用该同态数值比较器,通过GPU硬件实现可比较任意比特明文的多比特同态比较运算器。利用cuFHE同态算法库编写同态比较运算函数并进行测试,结果表明,该比较运算器效率较高,对 100 bit 的明文进行一次比较运算仅需0.91 s。展开更多
López-Alt et al.(STOC12)put forward a primitive called multi-key fully homomorphic encryption(MKFHE),in which each involved party encrypts their own data using keys that are independently and randomly chosen wher...López-Alt et al.(STOC12)put forward a primitive called multi-key fully homomorphic encryption(MKFHE),in which each involved party encrypts their own data using keys that are independently and randomly chosen whereby arbitrary computations can be performed on these encrypted data by a final collector.Subsequently,several superior schemes based on the standard assumption(LWE)were proposed.Most of these schemes were constructed by expanding a fresh GSW-ciphertext or BGV-ciphertext under a single key to a new same-type ciphertext of the same message under a combination of associated parties’keys.Therefore,the new ciphertext’s size grew more or less linearly with an increase in the number of parties.In this paper,we proposed a novel and simple scheme of MKFHE based on LWE without increasing the size of the ciphertext in the two non-collusion server model.In other words,each party first independently shares their own data between two servers and each server only needs a one-round communication with another to construct a ciphertext of the same plaintext under a sum of associated parties’keys.Our new ciphertext under multiple keys has the same size as that of the original one with only one-round communication between two servers.The communication complexity is O(kmlogq)-bit,where k is the number of input ciphertexts involved,m is the size of a GSW-ciphertext and q is a modulus.In conclusion,we proved that our scheme is CPA-secure against semi-honest adversaries.展开更多
多密钥全同态加密(multi-key fully homomorphic encryption,MK-FHE)技术支持对不同密钥加密的密文进行同态运算,能够直接应用于现实中的多用户数据融合计算场景,如多方协同计算和联邦学习。目前,主流的多密钥全同态加密主要通过自举技...多密钥全同态加密(multi-key fully homomorphic encryption,MK-FHE)技术支持对不同密钥加密的密文进行同态运算,能够直接应用于现实中的多用户数据融合计算场景,如多方协同计算和联邦学习。目前,主流的多密钥全同态加密主要通过自举技术实现对LWE(learning with error)加密密文的多密钥同态计算。将单密钥密文扩展为多密钥密文的时间效率和存储开销与自举技术密切相关,通常需要大量的同态评估密钥以及复杂的运算。因此,如何结合更优的自举技术设计多密钥全同态加密方案,进而提升计算效率与降低存储开销成为研究的关键问题。基于NTRU(number theory research unit)自举技术,设计了一种针对LWE密文的高效多密钥全同态加密方案。与其他方案相比,所提方案在密文扩展过程中具有更高的计算效率。此外,对所提方案的正确性进行了详细阐述和分析,并在理论上将所提方案与现有主流的多密钥全同态加密方案进行了多维度对比,结果显示所提方案具有更优的计算效率。最后,探索了该方案在多行业多源销售数据跨部门监管场景中的潜在应用,在保护数据隐私的前提下帮助税务部门实现税务核验,有助于推动各行业的数字化转型和健康发展。展开更多
文摘为在密态计算中实现高效的比较操作,设计一种支持并行加速的多比特同态比较运算器。基于cuFHE软件库构造单比特同态数值比较器,在并行运算模式下调用该同态数值比较器,通过GPU硬件实现可比较任意比特明文的多比特同态比较运算器。利用cuFHE同态算法库编写同态比较运算函数并进行测试,结果表明,该比较运算器效率较高,对 100 bit 的明文进行一次比较运算仅需0.91 s。
文摘López-Alt et al.(STOC12)put forward a primitive called multi-key fully homomorphic encryption(MKFHE),in which each involved party encrypts their own data using keys that are independently and randomly chosen whereby arbitrary computations can be performed on these encrypted data by a final collector.Subsequently,several superior schemes based on the standard assumption(LWE)were proposed.Most of these schemes were constructed by expanding a fresh GSW-ciphertext or BGV-ciphertext under a single key to a new same-type ciphertext of the same message under a combination of associated parties’keys.Therefore,the new ciphertext’s size grew more or less linearly with an increase in the number of parties.In this paper,we proposed a novel and simple scheme of MKFHE based on LWE without increasing the size of the ciphertext in the two non-collusion server model.In other words,each party first independently shares their own data between two servers and each server only needs a one-round communication with another to construct a ciphertext of the same plaintext under a sum of associated parties’keys.Our new ciphertext under multiple keys has the same size as that of the original one with only one-round communication between two servers.The communication complexity is O(kmlogq)-bit,where k is the number of input ciphertexts involved,m is the size of a GSW-ciphertext and q is a modulus.In conclusion,we proved that our scheme is CPA-secure against semi-honest adversaries.
文摘多密钥全同态加密(multi-key fully homomorphic encryption,MK-FHE)技术支持对不同密钥加密的密文进行同态运算,能够直接应用于现实中的多用户数据融合计算场景,如多方协同计算和联邦学习。目前,主流的多密钥全同态加密主要通过自举技术实现对LWE(learning with error)加密密文的多密钥同态计算。将单密钥密文扩展为多密钥密文的时间效率和存储开销与自举技术密切相关,通常需要大量的同态评估密钥以及复杂的运算。因此,如何结合更优的自举技术设计多密钥全同态加密方案,进而提升计算效率与降低存储开销成为研究的关键问题。基于NTRU(number theory research unit)自举技术,设计了一种针对LWE密文的高效多密钥全同态加密方案。与其他方案相比,所提方案在密文扩展过程中具有更高的计算效率。此外,对所提方案的正确性进行了详细阐述和分析,并在理论上将所提方案与现有主流的多密钥全同态加密方案进行了多维度对比,结果显示所提方案具有更优的计算效率。最后,探索了该方案在多行业多源销售数据跨部门监管场景中的潜在应用,在保护数据隐私的前提下帮助税务部门实现税务核验,有助于推动各行业的数字化转型和健康发展。
