Low data encryption efficiency and inadequate security are two issues with the current blockchain cross-chain transaction protection schemes.To address these issues,a blockchain cross-chain transaction protection sche...Low data encryption efficiency and inadequate security are two issues with the current blockchain cross-chain transaction protection schemes.To address these issues,a blockchain cross-chain transaction protection scheme based on Fully Homomorphic Encryption(FHE)is proposed.In the proposed scheme,the functional relationship is established by Box-Muller,Discrete Gaussian Distribution Function(DGDF)and Uniform Random Distribution Func-tion(URDF)are used to improve the security and efficiency of key generation.Subsequently,the data preprocessing function is introduced to perform cleaning,deduplication,and normalization operations on the transaction data of multi-key signature,and it is classified into interactive data and asset data,so as to perform different homomorphic operations in the FHE encryption stage.Ultimately,in the FHE encryption stage,homomorphic multiplication and homomorphic addition are used targeted for the interactive data and asset data,thereby reducing the computational complexity and enhancing the FHE encryption efficiency.The significance of the proposed scheme is proved by experimental results:Firstly,the multi-key generation function and its specific sampling method and transformation ensure the security and efficiency of key generation.Data preprocessing can also accelerate the FHE encryption process by eliminating invalid data and redundancy,so the FHE encryption efficiency is significantly improved.Secondly,the FHE encryption method based on discrete logarithm problem enhances the security of transaction data and can effectively resist multiple attacks.In addition,the preprocessed data also has good performance in capacity storage.The proposed scheme has significant impacts on key indicators such as encryption efficiency and security,it provides a new reference for blockchain cross-chain transaction protection technology and has an important impact on the security improvement of various cross-chain transaction data.展开更多
为在密态计算中实现高效的比较操作,设计一种支持并行加速的多比特同态比较运算器。基于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.展开更多
文摘Low data encryption efficiency and inadequate security are two issues with the current blockchain cross-chain transaction protection schemes.To address these issues,a blockchain cross-chain transaction protection scheme based on Fully Homomorphic Encryption(FHE)is proposed.In the proposed scheme,the functional relationship is established by Box-Muller,Discrete Gaussian Distribution Function(DGDF)and Uniform Random Distribution Func-tion(URDF)are used to improve the security and efficiency of key generation.Subsequently,the data preprocessing function is introduced to perform cleaning,deduplication,and normalization operations on the transaction data of multi-key signature,and it is classified into interactive data and asset data,so as to perform different homomorphic operations in the FHE encryption stage.Ultimately,in the FHE encryption stage,homomorphic multiplication and homomorphic addition are used targeted for the interactive data and asset data,thereby reducing the computational complexity and enhancing the FHE encryption efficiency.The significance of the proposed scheme is proved by experimental results:Firstly,the multi-key generation function and its specific sampling method and transformation ensure the security and efficiency of key generation.Data preprocessing can also accelerate the FHE encryption process by eliminating invalid data and redundancy,so the FHE encryption efficiency is significantly improved.Secondly,the FHE encryption method based on discrete logarithm problem enhances the security of transaction data and can effectively resist multiple attacks.In addition,the preprocessed data also has good performance in capacity storage.The proposed scheme has significant impacts on key indicators such as encryption efficiency and security,it provides a new reference for blockchain cross-chain transaction protection technology and has an important impact on the security improvement of various cross-chain transaction data.
文摘为在密态计算中实现高效的比较操作,设计一种支持并行加速的多比特同态比较运算器。基于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.
