Provably secure and efficient proxy signature scheme

Jie ZENG; Wei NIE

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

您当前的位置：

首页 >

文章列表页 >

Provably secure and efficient proxy signature scheme

更新时间：2024-10-11

- Provably secure and efficient proxy signature scheme
- Journal on Communications Vol. 35, Issue 8, Pages: 216-222(2014)
- 作者机构：
  
  1. 深圳大学信息工程学院，广东深圳51806
  2. 深圳市现代通信与信息处理重点实验室，广东深圳518060)
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.1000-436x.2014.08.026
  CLC： TP 309
- Online First：2014-08，
  
  Published：25 August 2014
- 稿件说明：
移动端阅览
Jie ZENG, Wei NIE. Provably secure and efficient proxy signature scheme[J]. Journal on Communications, 2014, 35(8): 216-222.
DOI：

Jie ZENG, Wei NIE. Provably secure and efficient proxy signature scheme[J]. Journal on Communications, 2014, 35(8): 216-222. DOI： 10.3969/j.issn.1000-436x.2014.08.026.

摘要

针对固定维数的格基委托算法或格上基于盆景树生成的代理签名方案中私钥和签名的长度均过大的问题，提出一种较小尺寸的代理签名方案。该方案对随机预言机进行了合并优化，并使用一个更小范数但是向量盲化的消息，从而控制代理签名私钥的维数，其安全性基于格上最短向量问题和小整数解问题的困难性，并且满足代理签名方案所有的安全性要求。与现有方案相比，该方案有效地减小了代理签名私钥和代理签名的长度，使代理私钥长度与原始签名用户私钥长度相当。

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.

关键词

Keywords

references

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 .

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 .

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 .

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 .

AGRAWAL S , BONEH D , BOYEN X . Efficient lattice (H)IBE in the standard model [A ] . EUROCRYPT 2010, LNCS [C ] . Riviera, France , 2010 , 553 - 572 .

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 .

LYUBASHEVSKY V . Lattice signatures without trapdoors [A ] . Eurocrypt 2012, LNCS [C ] . Cambridge, UK , 2012 , 738 - 755 .

JIANG Y L , KONG F Y , JU X L . Lattice-based Proxy signature [A ] . CIS 2010 [C ] . Nanning, China , 2010 , 382 - 385 .

夏峰，杨波，马莎等 . 基于格的代理签名方案 [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 .

WANG C X , QI M N . Lattice-based proxy signature scheme [J ] . Jour-nal of Information and Computational Science , 2011 , 12 ( 8 ): 2451 - 2458 .

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 .

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 .

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 .

MICHAEL S L , TERRENCE J S . Learning over complete representa-tions [J ] . Neural Computation , 2000 , 12 ( 2 ): 337 - 365 .

MICCIANCIO D , SHA GOLDWASSER . Complexity of Lattice Problems: a Cryptographic Perspective [M ] . Boston : Kluwer Academic Publishers , 2002 : 1 - 220 .

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 .

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 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices: simpler, tighter, faster, smaller [A ] . EUROCRYPT 2012 [C ] . Cambridge, UK , 2012 , 700 - 718 .

RÜCKERT M . Lattice-based blind signatures [EB/OL ] . http://eprint. iacr.org/2008/322 http://eprint. iacr.org/2008/322 , 2010 .

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 .

Views

575

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Attribute-based proxy signature scheme for unmanned aerial vehicle networks

Provable security signcryption scheme based on RLWE without trapdoor

Integrity checking protocol with identity-based proxy signature in mobile cloud computing

Forward secure proxy signature scheme

Related Author

Lei HE

Jianfeng MA

Dawei WEI

Zhen LIU

Yiliang HAN

Xiaoyuan YANG

Shuguang LIU

Li YAN

Related Institution

School of Computer Science and Technology, Xidian University

College of Computer and Communication Engineering, Zhengzhou University of Light Industry

School of Cyber Engineering, Xidian University

Shaanxi Key Laboratory of Network and System Security, Xidian University

College of Cryptography Engineering, Engineering University of PAP

AI问答

⁰