可证安全的有效代理签名方案

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

Journal on Communications ›› 2014, Vol. 35 ›› Issue (8): 216-222.doi: 10.3969/j.issn.1000-436x.2014.08.026

Provably secure and efficient proxy signature scheme

Jie ZENG^1,²,Wei NIE^1,²

¹ College of Information Engineering, Shenzhen University, Shenzhen 518060, China
² Shenzhen Modern Communication and Information Processing Key Lab, Shenzhen 518060, China)

Online:2014-08-25 Published:2017-06-29
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Ph.D Programs Foundation of Ministry of China;The Natural Science Foundation of Guangdong Province;The Natural Science Foundation of Guangdong Province;The Natural Science Foundation of Guangdong Province;Scientific and Technological Innovation Project of Department of Education of Guangdong Province;Scientific and Technological Innovation Project of Department of Education of Guangdong Province;Fundamental Research General Program of Shenzhen City;Fundamental Research General Program of Shenzhen City

Abstract

Abstract:

The size of proxy signature secret key in proxy signature scheme based on lattice basis delegation in fixed di-mension or bonsai tree is greater than that of original signature secret key. Aiming at the situation above, a new efficient proxy signature scheme is proposed. The random oracles are combined in the scheme and a smaller vector norm blind message is used to control the dimension of proxy signature secret key. The security of proposed scheme is based on the hardness of shortest vector problem and small integer solution problem, and the scheme satisfies the security require-ments of a proxy signature scheme. Compared with other schemes over lattice, the size of proxy signature secret key and proxy signature is reduced, and the size of proxy signature secret key is equivalent to that of the original signature secret key in magnitude.

Key words: without trapdoor, small norm, proxy signature, bonsai tree

Jie ZENG,Wei NIE. Provably secure and efficient proxy signature scheme[J]. Journal on Communications, 2014, 35(8): 216-222.

Figures/Tables 3

方案	代理私钥长度/bit	代理签名长度/bit	原始签名用户私钥长度/bit	签名长度增长速度
文献[8]	4m ²log $(L M \sqrt{2 m})$	2mlog(LM 2m ²)	(n+m)log(q)	οn²( )
文献[11]	m ²log(LM4m^{3 2})	mlog(LM ⁵m²)	(n+m)log(q)	ο(n²)
文献[12]	4m ²log $(L M \sqrt{2 m})$	2mlog(LM 2m ²)	(n+m)log(q)	ο(n²)
文献[13]	m ²log(LM4m^{3 2})	mlog(LM ⁵m²)	(n+m)log(q)	ο(n²)
优化方案	m log(2md+1)	m log(12σ)	m log(q)	ο(n )

References 20

[1]	MAMBO M , USUDA K , OKAMOTO K . Proxy signatures: delegation of the power to sign messages[J]. IEICE Transactions on Fundamen-tals, 1996, 79(9): 1338-1353.
[2]	SHOR P W . Polynomial-time algorithm for prime factorization and discrete logarithm on a quantum computer[J]. SIAM Journal on Com-puting, 1997, 26(5): 1484-1509.
[3]	YAO , YAN Q , LI Z J , GUO H . A novel nonlinear network coding signature scheme determined by the SIS problem[J]. International Journal of Security and its Applications, 2012, 6(2): 403-408.
[4]	CASH D , HOFHEINZ D , KILTZ E , et al. Bonsai trees, or how to delegate a lattice basis[J]. Journal of Cryptology, 2012, 25(4): 601-639.
[5]	AGRAWAL S , BONEH D , BOYEN X . Efficient lattice (H)IBE in the standard model[A]. EUROCRYPT 2010, LNCS[C]. Riviera, France, 2010, 553-572.
[6]	AGRAWAL S , BONEH D , BOYEN X . Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[A]. CRYPTO 2010, LNCS[C]. CA, USA, 2010, 98-115.
[7]	LYUBASHEVSKY V . Lattice signatures without trapdoors[A]. Eurocrypt 2012, LNCS[C]. Cambridge, UK, 2012, 738-755.
[8]	JIANG Y L , KONG F Y , JU X L . Lattice-based Proxy signature[A]. CIS 2010[C]. Nanning, China, 2010, 382-385.
[9]	夏峰，杨波，马莎等. 基于格的代理签名方案[J]. 湖南大学学报（自然科学版）， 2011,38(6):84-88. XIA F , YANG B , MA S , et al. Lattice-based proxy signature scheme [J]. Journal of Hunan University(Natural Sciences), 2011,38(6):84-88.
[10]	WANG C X , QI M N . Lattice-based proxy signature scheme[J]. Jour-nal of Information and Computational Science, 2011, 12(8): 2451-2458.
[11]	KIM K S , HONG D , JEONG I R . Identity-based proxy signature from lattices[J]. JJournal of Communications and Networks, 2013, 15(1): 1-7.
[12]	BISWAS S , MISC J , MISC V . An identity-based authentication scheme for safety messages in wave-enabled vanets[J]. International Journal of Parallel, Emergent and Distributed Systems, 2012, 27(6): 541-546.
[13]	SWAPNA G , REDDY P V , GOWRI T . Efficient identity-based multi-proxy multi-signcryption scheme using bilinear pairings over el-liptic curves[A]. ICACCI 2013[C]. Mysore, India, 2013, 418-423.
[14]	MICHAEL S L , TERRENCE J S . Learning over complete representa-tions[J]. Neural Computation, 2000, 12(2): 337-365.
[15]	MICCIANCIO D , SHA GOLDWASSER . Complexity of Lattice Problems: a Cryptographic Perspective[M]. Boston: Kluwer Academic Publishers, 2002: 1-220.
[16]	MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures[A]. Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science[C] Rome, Italy, 2004. 372-381.
[17]	CASH D , HOFHEINZ D , KILTZ E , et al. Bonsai trees, or how to delegate a lattice basis[A]. Advances in Cryptology- EUROCRYPT 2010[C]. Riviera, France, 2010, 523-552.
[18]	MICCIANCIO D , PEIKERT C . Trapdoors for lattices: simpler, tighter, faster, smaller[A]. EUROCRYPT 2012[C]. Cambridge, UK, 2012, 700-718.
[19]	RüCKERT M . Lattice-based blind signatures[EB/OL]. , 2010.
[20]	BELLARE M , NEVEN G . Multi-signatures in the plain public-key model and a general forking lemma[A]. roceedings of ACM CCS 2006[C]. Alexandria, 2006, 390-399.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	基于格上困难问题	安全模型
文献[8]	大数分解困难性	Selective-ID
文献[11]	离散对数困难性	Full-ID
文献[12]	SIVP	Generalized Selective-ID
文献[13]	SVP	Selective-ID
优化方案	SVP/SIVP	Full-ID

Provably secure and efficient proxy signature scheme

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 3

References 20

Related Articles 10

Metrics

Recommended 0

方案	签名速度/步	验证速度/步
文献[8]	ο(n )	οn²( )
文献[11]	ο(n )	ο(n²)
文献[12]	ο(n )	ο(n²)
文献[13]	ο(n )	ο(n²)
优化方案	ο(n )	ο(n²)

[1]	Lei HE, Jianfeng MA, Dawei WEI. Attribute-based proxy signature scheme for unmanned aerial vehicle networks [J]. Journal on Communications, 2021, 42(11): 87-96.
[2]	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.
[3]	Li YAN,Run-hua SHI,Hong ZHONG,Jie CUI,Shun ZHANG,Yan XU. Integrity checking protocol with identity-based proxy signature in mobile cloud computing [J]. Journal on Communications, 2015, 36(10): 278-286.
[4]	. Provably secure and efficient proxy signature scheme [J]. Journal on Communications, 2014, 35(8): 26-222.
[5]	Yi-ke YU,Xue-feng ZHENG. ID-based efficient and proactive threshold proxy signature in the standard model [J]. Journal on Communications, 2011, 32(8): 55-63.
[6]	Guo-sheng XU,Li-ze GU,Yi-xian YANG,Zhong-xian LI. New transferable electronic cash scheme [J]. Journal on Communications, 2008, 29(5): 1-5.
[7]	Zhao-xia TANG,Qiu-liang XU. Threshold proxy signature scheme with designated-verifier [J]. Journal on Communications, 2008, 29(3A): 84-88.
[8]	Zhao-xia TANG,Qiu-liang XU,Jian-dong ZHU. ID-based designated multi verifier proxy signature scheme [J]. Journal on Communications, 2008, 29(11A): 41-45.
[9]	Li KANG,Mian CAI,Ya-jun WANG. Blind proxy multi-signature schemes based on Nyberg-Rueppel signature scheme [J]. Journal on Communications, 2007, 28(3): 115-119.
[10]	ANGXiao-ming W,HENHuo-yan C,UFang-wei F. Forward secure proxy signature scheme [J]. Journal on Communications, 2005, 26(11): 38-41.