【摘要】：為了支持任意電路上簽名數(shù)據(jù)同態(tài)運(yùn)算,本文利用陷門(mén)采樣技術(shù),基于與門(mén)和異或門(mén)構(gòu)造了一個(gè)只受電路深度和安全參數(shù)影響的層次全同態(tài)簽名方案。電路生成的新簽名具有公開(kāi)可驗(yàn)證性,新簽名尺寸與電路尺寸以及原簽名數(shù)據(jù)的尺寸無(wú)關(guān)。方案在標(biāo)準(zhǔn)模型下基于格上最短整數(shù)解困難問(wèn)題可證安全。用戶(hù)可以在不知道私鑰的情況下進(jìn)行指定簽名集合中簽名的層次全同態(tài)運(yùn)算,已有的研究還主要集中在線(xiàn)性同態(tài)方案和多項(xiàng)式同態(tài)方案。
[Abstract]:In order to support the homomorphism operation of signature data on arbitrary circuits, a hierarchical homomorphic signature scheme based on gate and XOR gates is constructed based on trapdoor sampling technique, which is only affected by circuit depth and security parameters. The new signature generated by the circuit is publicly verifiable, and the size of the new signature is independent of the size of the circuit and the size of the original signature data. The scheme is provable security based on the shortest integer solution on the lattice under the standard model. Users can perform the hierarchical homomorphism operation of the signature in the specified signature set without knowing the private key. The existing researches mainly focus on the linear homomorphism scheme and the polynomial homomorphism scheme.
【作者單位】： 哈爾濱工程大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;哈爾濱工程大學(xué)教務(wù)處;哈爾濱工程大學(xué)國(guó)家保密學(xué)院;
【基金】：國(guó)家自然科學(xué)基金項(xiàng)目(61170241,61472097)
【分類(lèi)號(hào)】：TN918.91

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 楊耀增;;用同態(tài)，

本文編號(hào)：2281642