基于多项式同构的代理重签名方案

doi:10.11959/j.issn.1000-436x.2017024

Journal on Communications ›› 2017, Vol. 38 ›› Issue (2): 16-24.doi: 10.11959/j.issn.1000-436x.2017024

• Papers • Previous Articles Next Articles

Proxy re-signature scheme based on isomorphisms of polynomial

Hui-xian LI¹,Lu SHAO¹,Liao-jun PANG²

¹ School of Computer Science and Engineering,Northwestern Polytechnical University,Xi'an 710072,China
² State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an 710071,China

Revised:2016-12-27 Online:2017-02-01 Published:2017-07-20
Supported by:
The National Natural Science Foundation of China(61103178);The National Natural Science Foundation of China(61473214);The Natural Science Basic Research Plan in Shaanxi Province of China(2015JM6294);The Natural Science Basic Research Plan in Shaanxi Province of China(2016JM6002);The Natural Science Basic Research Plan in Shaanxi Province of China(2015JM6294);The Fundamental Research Funds for the Central Universities(3102015JSJ0003)

Abstract

Abstract:

Most of the existing proxy resignature schemes were based on the hardness of big integer factoring,discrete logarithm,elliptic curve.However,none of them can resist the attack by a quantum computer.Motivated by these concerns,a new proxy resignature scheme was proposed.By employing secret affine transformations and homogeneous polynomials,the proposed scheme could implement the signature transformation with high-efficiency,and meanwhile it was secure against the attack by a quantum computer.The results of analysis showed that the proposed scheme was correct and consistent,and had the unforgeability in the random oracle model.Compared with the existing schemes,the proposed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems,but also has the properties of multi-use,transparent and private proxy.

Key words: proxy re-signature, multivariate public key cryptosystem, isomorphisms of polynomial, affine transformation

CLC Number:

TP309

Hui-xian LI,Lu SHAO,Liao-jun PANG. Proxy re-signature scheme based on isomorphisms of polynomial[J]. Journal on Communications, 2017, 38(2): 16-24.

Figures/Tables 1

References 17

[1]	BOLDYREVA A , PALACIO A , WARINSCHI B . Secure proxy signature schemes for delegation of signing rights[J]. Journal of Cryptology, 2012,25(1): 57-115.
[2]	CHEN X , LENZINI G , MAUW S ,et al. A group signature based electronic toll pricing system[C]// International Conference on Availability,IEEE Computer Society. 2011: 85-93.
[3]	SEVERENS M , FARQUHAR J , DUYSENS J ,et al. A multi-signature brain-computer interface:use of transient and steady-state responses[J]. Journal of Neural Engineering, 2013,10(10): 1160-1166.
[4]	BLAZE M , BLEUMER G , STRAUSS M . Divertible protocols and atomic proxy cryptography[J]. Lecture Notes in Computer Science, 1998,1403: 127-144.
[5]	ATENIESE G , HOHENBERGER S . Proxy re-signatures:new definitions,algorithms,and applications[C]// ACM Conference on Computer and Communications Security. 2005: 310-319.
[6]	SHAO J , CAO Z , WANG L C ,et al. Proxy re-signature schemes without random oracles[C]// Progress in Cryptology-Indocrypt 2007,International Conference on Cryptology in India. 2007: 197-209.
[7]	WATERS B , . Efficient identity-based encryption without random oracles[M]// Advances in Cryptology-EUROCRYPT 2005. Springer Berlin Heidelberg, 2005: 114-127.
[8]	LIBERT B , VERGNAUD D . Multi-use unidirectional proxy resignatures[C]// ACM Conference on Computer and Communications Security.ACM. 2008: 511-520.
[9]	YANG P , CAO Z , DONG X . Threshold proxy re-signature[J]. Journal of Systems Science ＆Complexity, 2008,24(4): 816-824.
[10]	SHAMIR A . How to share a secret[J]. Communications of the ACM, 1979,22(11): 612-613.
[11]	YANG X D , ZHANG L , WANG C F . A flexible threshold proxy re-signature scheme with provable security[J]. Computer Engineering＆Science, 2014.
[12]	FENG J , LAN C H , JIA B R . ID-based proxy resignature scheme with strong unforgeability[J]. Journal of Computer Applications, 2014.
[13]	ZHANG Y L , YANG X D , WANG C F . ID-based bidirectional threshold proxy re-signature[J]. Journal of Computer Applications, 2011,31(1): 4920-4926.
[14]	SHOR P W . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. Siam Review, 1997,41(2): 1484-1509.
[15]	JACQUES P , . Hidden fields equations (HFE) and isomorphisms of polynomials (IP):two new families of asymmetric algorithms[M]// Advances in Cryptology–EUROCRY- PT'96. Springer Berlin Heidelberg, 1996: 33-48.
[16]	TANG S , XU L . Proxy signature scheme based on isomorphisms of polynomials[C]// Network and System Security(NSS) 2012. 2012: 113-125.
[17]	刘文浩, 许春香 . 无证书两方密钥协商方案[J]. 软件学报, 2011,22(11): 2843-2852.
	LIU W H , XU C X . Two party certificateless key agreement schemes[J]. Journal of Software, 2011,22(11): 2843-2852.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	重签名阶段	验证阶段	公钥开销	私钥开销
BBS^[4]	ke+h	3ke+h	\|p\|	\|q\|
AH^[5]	2e+h	2P+h	\|2^k\|	\|q\|
SCW^[6]	6e+h	3P+h	\|p\|	\|q\|
LV^[8]	7e+h	6P+h	\|p\|	\|p\|
本文方案	h	2h	8u(n+1)(n+2)	8u(u+1)+8n(n+1)

Proxy re-signature scheme based on isomorphisms of polynomial

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 17

Related Articles 4

Metrics

Recommended 0

[1]	Xiaodong YANG,Yutong LI,Jinli WANG,Tingchun MA,Caifen WANG. Revocable identity-based proxy re-signature scheme in the standard model [J]. Journal on Communications, 2019, 40(5): 153-162.
[2]	Xiaodong YANG,Chunlin CHEN,Ping YANG,Faying AN,Tingchun MA,Caifen WANG. Partially blind proxy re-signature scheme with proven security [J]. Journal on Communications, 2018, 39(2): 65-72.
[3]	Xu-yun NIE,Bo LIU,Gang LU,Ting ZHONG. Cryptanalysis of novel extended multivariate public key cryptosystem [J]. Journal on Communications, 2015, 36(6): 60-65.
[4]	Tao FENG,Yi-xin LIANG. Provably secure certificate less blind proxy re-signatures [J]. Journal on Communications, 2012, 33(Z1): 58-69.