基于同态加密体制的通用可传递签名方案

doi:10.3969/j.issn.1000-436x.2013.11.003

Abstract

Abstract:

After investigating the existing transitive signature schemes based on the mathematical assumptions of integer factorization problem, discrete logarithm and bilinear pairings, the common method of transitive signature schemes was extracted. Based on this, a general transitive signature scheme based on homomorphic encryption was proposed, which can achieve signature verification by using the properties of homomorphic encryption. The scheme provides a gener l construction for the transitive signature scheme based on the particular homomorphic signature schemes. Moreover, the security proofs were given by defining the appropriate security goals and designing security experiments. The proofs show the general transitive signature scheme is a CMA secure and only if corresponding homomorphic encryption is CPA secure and the standard signature is CMA secure. Finally, analysis and comparison show that the proposed scheme is effective.

Key words: transitive signature, homomorphic encryption, binary relation, provable security, CMA

Chang-gen PENG,You-liang TIAN,Bao ZHANG,Zhi-pin XU. General transitive signature scheme based on homomorphic encryption[J]. Journal on Communications, 2013, 34(11): 18-25.

Figures/Tables 12

方案	签名开销	验证开销	签名合成开销	签名长度
RSATS	2stand.signs.＆2T_ein $Z_{n}^{*}$	2stand.Verifs ＆1T_ein $Z_{n}^{*}$	O(\|n\|²)ops	2stand.signs. ＆3points in $Z_{n}^{*}$
MRTS	2stand.signs.＆2T_ein G	2stand.Verifs＆2T_e+1T_min G	2T_m in Z_q	2stand.signs.＆2pointsinZ_q＆2points in G
BG-PTS	2stand.signs.＆2T_ein $\hat{G}$	2stand.Verifs＆2T_pin $\hat{G}$	O(\|n\|²)ops	2stand. signs. ＆3points in G
HETS	2stand.signs.＆ 2H.encs	2stand.Verifs＆1H.enc	1T_m in Z_q	2 stand. signs. ＆3points in G

References 21

[1]	MICALI S , RIVEST R . Transitive signature schemes[A]. Proceedings of the Cryptographers' Track at the RSA Conference[C]. San Jose, 2002.236-243.
[2]	BELLARE M , NEVEN G . Transitive signatures based on factoring and RSA[A]. Proceedings of the 8th International Confe on the Theory and Application of Cryptology and Information Security Queenstown[C]. New Zealand, 2002.397-414.
[3]	HOHENHERGER S . The Cryptographic Impact of Groups with In-feasible Inversion[D]. Massachusetts Institute of Technology, 2003.
[4]	KUWAKADO H , TANAKA H . Transitive signature scheme for di-rected trees[J]. IEICE Transactions on Fundamenta, 2003,E86- A(5): 1120-1126.
[5]	VAN H E , PEDERSEN T P , PFITZMANN B . New constructions of fail-stop signatures and lower bounds[A]. Proceedings of the 12th Annual International Cryptology Conference[C]. Santa Barbara, 1992.15-30.
[6]	YI X , TAN C H , OKAMOTO E . Security of kuwakado-tanaka transi-tive signature scheme for directed trees[J]. IEICE Tra tions on Fundamentals, 2004,E87- A(4): 955-957.
[7]	ZHOU S J . Transitive Signatures Based on Non-Adaptive Standard Signatures[R]. Cryptography ePrint Archive Report, 2004.
[8]	ZHU H . Model for undirected transitive signatures[J]. EE Proceed-ings Communications, 2004,151 (4): 312-315.
[9]	SHAHANDASHTI S F , SALMADIZADEH M , MOHAJERI J . A provably secure short transitive signature scheme from bilinear group pairs[A]. Proceedings of the 4th International Conference on Security in Communication Networks[A]. Amalfi,Italy, 2004.60-76.
[10]	BELLARE M , NEVEN G . Transitive signatures: new schemes and proofs[J]. IEEE Transactions on Information Theory, 2005,51 (6): 2133-2151.
[11]	MA C G , WU P , GU G C . A new method for the design of stateless transitive signature scheme[A]. Proceedings of the APWeb International Workshops: XRA, IWSN, MEGA, and ICSE[C]. Haerbin, 2006.897-904.
[12]	黄振杰，郝艳华，王育民 . 一个高效的有向传递签名方案[J]. 电子学报, 2005,33 (8): 1497-1501. HUANG Z J , HAO Y H , WANG Y M . Efficient directed trans tive scheme[J]. ACTA Electronica Sinica, 2005,33 (8): 1497-1501.
[13]	YI X . Directed transitive signature scheme[A]. Proceedings of the Cryptographers' Track at the RSA Conference[C]. San Francisco, 2007.129-144.
[14]	NEVEN G . A simple transitive signature scheme for directed trees[J]. Theoretical Computer Science, 2008,396 (1-3): 277-282.
[15]	马春光，蔡满春，武朋 . 基于单向累加器的无向可传递闭包图认证[J]. 通信学报, 2008,29 (3): 63-69. MA C G , CAI M C , WU P . Transitively closed undirected au-thentication based on one-way accumulators[J]. Journal on Commu-nications, 2008,29 (3): 63-69.
[16]	XU J . On Directed Transitive Signature[R]. Cryptology ePrint Archive, Report, 2009.
[17]	ZHENG G , ZHENG H , QIU W D , et al Transitive signature scheme from LFSR[J]. Journal of Information Science and Engineering, 2010,26: 131-143.
[18]	马小龙，谷利泽，崔巍等. 标准模型下基于身份的传递签名[J]. 通信学报, 2010,31 (5): 37-43. MA X L , GU L Z , CUI W , et al. ID-based transitive signature schemes without random oracle[J]. Journal on Communications, 2010,31 (5): 37-43.
[19]	CAMACHO P , HEVIA A . Short transitive signatures for directed trees[A]. Proceedings of the Cryptographers' Track at he RSA Con-ference[C]. San Francisco, 2012.35-50.
[20]	KUN M , HAN L , KAIJIE W . Homomorphic property-based concur-rent error detection of RSA: a countermeasure to fault attack[J]. IEEE Transactions on Computers, 2012,61 (7): 1040-1049.
[21]	GENTRY C . Fully homomorphic encryption using ideal lattices[A]. Proceedings of the 41st Annual ACM Symposium on Theory of Computing[C]. New York, 2009.169-178.

Metrics

Recommended 0

No Suggested Reading articles found!

General transitive signature scheme based on homomorphic encryption

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 12

References 21

Related Articles 15

Metrics

Recommended 0

[1]	Xindi MA, Qinghua LI, Qi JIANG, Zhuo MA, Sheng GAO, Youliang TIAN, Jianfeng MA. Byzantine-robust federated learning over Non-IID data [J]. Journal on Communications, 2023, 44(6): 138-153.
[2]	Shengxing YU, Zhong CHEN. Efficient secure federated learning aggregation framework based on homomorphic encryption [J]. Journal on Communications, 2023, 44(1): 14-28.
[3]	Yatao YANG, Deli LIU, Peihe LIU, Ping ZENG, Song XIAO. BFV-Blockchainvoting: blockchain-based electronic voting systems with BFV full homomorphic encryption [J]. Journal on Communications, 2022, 43(9): 100-111.
[4]	Xuewang ZHANG, Zhihong LI, Jinzhao LIN. Privacy protection scheme based on fair blind signature and hierarchical encryption for consortium blockchain [J]. Journal on Communications, 2022, 43(8): 131-141.
[5]	Huanhuan LIAN, Huiying HOU, Yunlei ZHAO. Post-quantum verifier-based three-party password authenticated key exchange protocol [J]. Journal on Communications, 2022, 43(4): 95-106.
[6]	Haining YU, Hongli ZHANG, Xiangzhan YU, Jiaxing QU, Mengmeng GE. Privacy-preserving trajectory similarity computation method [J]. Journal on Communications, 2022, 43(11): 1-13.
[7]	Sheng GAO, Kang XIANG, Youliang TIAN, Weijie TAN, Tao FENG, Xiaoxue WU. BCP-based joint delegation learning model and protocol [J]. Journal on Communications, 2021, 42(5): 137-148.
[8]	Ruiqi LI, Chunfu JIA, Yafei WANG. Multi-key homomorphic proxy re-encryption scheme based on NTRU and its application [J]. Journal on Communications, 2021, 42(3): 11-22.
[9]	Chunfu JIA, Ruiqi LI, Yafei WANG. Privacy protection scheme of DBSCAN clustering based on homomorphic encryption [J]. Journal on Communications, 2021, 42(2): 1-11.
[10]	Yousheng ZHOU,Chang TAN,Fei TANG. Multi-dimensional secure query scheme for fog-enhanced IIoT [J]. Journal on Communications, 2020, 41(8): 175-186.
[11]	Zhen LIU,Yiliang HAN,Xiaoyuan YANG,Shuguang LIU. Provable security signcryption scheme based on RLWE without trapdoor [J]. Journal on Communications, 2020, 41(6): 14-25.
[12]	Changgen PENG, Xiaoyu ZHANG, Hongfa DING, Shanhui YANG. Efficient signcryption scheme based on Cocks’ identity cryptosystem [J]. Journal on Communications, 2020, 41(12): 128-138.
[13]	Youliang TIAN,Qiuxian LI,Duo ZHANG,Linjie WANG. Provably secure rational delegation computation protocol [J]. Journal on Communications, 2019, 40(7): 135-143.
[14]	Bin WANG,Lei ZHANG,Guoyin ZHANG. Attribute generalization mix-zone based on multiple secure computation [J]. Journal on Communications, 2019, 40(4): 83-94.
[15]	Geng ZHAO,Yanyan MA,Yingjie MA. Design of SCMA codebook based on chaotic signal and system performance analysis [J]. Journal on Communications, 2019, 40(2): 137-144.