An Efficient Lattice-based Proxy Signature Scheme without Trapdoor

被引：8

作者：

Yang, Chunli ^{[1
,2
]}

Qiu, Peigang ^{[1
,2
]}

Zheng, Shihui ^{[3
]}

Wang, Licheng ^{[3
]}

机构：

[1] State Post Bur, Postal Secur Ctr, 5 Guajiatun, Beijing, Haidian Distric, Peoples R China

[2] Beijing Univ Posts & Telecommun, Sch Comp Sci, Beijing 100088, Haidian Distric, Peoples R China

[3] Natl Engn Lab Disaster Backup & Recovery, Beijing, Haidian Distric, Peoples R China

来源：

2015 INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING (IIH-MSP) | 2015年

关键词：

proxy signature; lattices; without trapdoor; rejection sampling;

D O I：

10.1109/IIH-MSP.2015.90

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Lattice-based proxy signature is a kind of signature that can resist the known quantum attack and a special digital signature which has the proxy functionality. So far, as far as I know, all lattice-based proxy signatures that use the "hash-and-sign" method of GPV08 signature are low efficient due to the time-consuming preimage sampleable algorithm. Based on the rejection sampling technique of Lyu12 signature, we proposed an efficient lattice-based proxy signature scheme without trapdoor, and the formal security proof of existentially unforgeable is given in random oracle model. In addition, the length of keys and signature in our scheme are shorter than all existing lattice-based proxy signature schemes, and the computations are also small.

引用

页码：189 / 194

页数：6

共 21 条

[1]

Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6

[2] Generating Shorter Bases for Hard Random Lattices [J].

Alwen, Joel ;

Peikert, Chris .

THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553

[3]

[Anonymous], 2011, J INF COMPUT SCI

[4]

[Anonymous], 2009, Post quantum cryptography

[5]

Bellare M., 2006, CCS 2006, P390, DOI [10.1145/1180405.1180453, DOI 10.1145/1180405.1180453]

[6] Secure Proxy Signature Schemes for Delegation of Signing Rights [J].

Boldyreva, Alexandra ;

Palacio, Adriana ;

Warinschi, Bogdan .

JOURNAL OF CRYPTOLOGY, 2012, 25 (01) :57-115

[7] Bonsai Trees, or How to Delegate a Lattice Basis [J].

Cash, David ;

Hofheinz, Dennis ;

Kiltz, Eike ;

Peikert, Chris .

JOURNAL OF CRYPTOLOGY, 2012, 25 (04) :601-639

[8]

Ducas L, 2013, LECT NOTES COMPUT SC, V8042, P40, DOI 10.1007/978-3-642-40041-4_3

[9]

Gentry C, 2008, ACM S THEORY COMPUT, P197

[10]

JING M, J BEIJING U POSTS TE

← 1 2 3 →