One-move convertible nominative signature in the standard model

被引:0
作者
Liu, Dennis Y. W. [1 ,2 ]
Wong, Duncan S. [2 ]
机构
[1] Univ Hong Kong, Sch Profess & Continuing Educ, Hong Kong, Hong Kong, Peoples R China
[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
关键词
nominative signature; undeniable signature; non-self-authenticating signature; generic construction; RANDOM ORACLES; KNOWLEDGE; SECURITY;
D O I
10.1002/sec.812
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A nominative signature (NS) is a non-self-authenticating signature that is jointly generated by a signer (or a nominator) and a user (or a nominee), but once generated, its validity can only be determined by the user. No one else including the signer can tell the signature's validity unless the user confirms or disavows so, whereas the user cannot cheat either. One-move NS is an efficient type of NS that requires the signer to send only one message to the user during the signature generation stage. Currently, there exists only one one-move NS scheme that is proven secure in the standard model, and is convertible, that is, the user can transform a nominative signature to a publicly verifiable standard signature without the signer's aid. However, the number of elements in the keys of both signer and user grows linearly with the value of the security parameter. In this paper, we propose a new one-move NS which is convertible, can be proven secure in the standard model, and also has a constant number of elements in the keys of both the signer and the user. We apply the Boneh-Boyen short standard signature in a novel way to build this nominative signature scheme. We show that this new scheme achieves the best performance among all the schemes proven secure in the standard model, and its security relies only on the standard q-strong Diffie-Hellman and decisional Diffie-Hellman assumptions. Finally, we will present a generic construction by utilizing a secure standard signature scheme and a secure encryption scheme. Copyright (c) 2013 John Wiley & Sons, Ltd.
引用
收藏
页码:1796 / 1809
页数:14
相关论文
共 35 条
[31]   Short computational Diffie-Hellman-based proxy signature scheme in the standard model [J].
Zhang, Jianhong ;
Yu, Yong .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2014, 27 (10) :1894-1907
[32]   Certificateless Aggregate Signature Scheme With Security Proofs in the Standard Model Suitable for Internet of Vehicles [J].
Deng, Lunzhi ;
Wen, Jian ;
Gao, Yan ;
Wang, Na ;
Huang, Huawei ;
Li, Siwei .
IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (17) :28765-28773
[33]   New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model [J].
Phong, Le Trieu ;
Ogata, Wakaha .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2009, E92A (08) :1822-1835
[34]   New Lattice-Based Short Proxy Signature Scheme With Fewer System Parameters in the Standard Model [J].
Wang, Zecheng ;
Bao, Huaizhong ;
Zhao, Tao ;
Du, Faze ;
Chen, Xuemin .
IEEE ACCESS, 2022, 10 :57180-57191
[35]   Adaptive-ID Secure Identity-Based Signature Scheme from Lattices in the Standard Model [J].
Wang, Zecheng ;
Chen, Xuemin ;
Wang, Pingshui .
IEEE ACCESS, 2017, 5 :20791-20799