Generalization of perfect concurrent signatures  

作　　者：YE Qing ZHENG Shi-hui GUO Hong-fu YANG Yi-xian 

机构地区：[1]Information Security Center,Beijing University of Posts and Telecommunications [2]School of Aerospace Engineering,Beijing Institute of Technology

出　　处：《The Journal of China Universities of Posts and Telecommunications》2012年第6期94-104,共11页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61003285);the Fundamental Research Funds for the Central Universities(BUPT2012RC0219)

摘　　要：Recently, Susilo et al.＇s perfect concurrent signature scheme （PCS1） and Wang et al.＇s improved perfect concurrent signature scheme （iPCS1） are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.＇s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. Security proofs and efficiency analysis are also given.Recently, Susilo et al.＇s perfect concurrent signature scheme （PCS1） and Wang et al.＇s improved perfect concurrent signature scheme （iPCS1） are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.＇s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. Security proofs and efficiency analysis are also given.

关 键 词：GENERALIZATION perfect concurrent signature fair exchange VARIANT Schnorr 

分 类 号：TN918.1[电子电信—通信与信息系统]