| Verifiably Encrypted Signatures Without Random Oracles |
| |
| 作者姓名： | 李祥学 陈克非 刘胜利 李世群 |
| |
| 作者单位： | Dept. of Computer Science and Eng. Shanghai Jiaotong Univ. Shanghai 200030 China，School of Information Security Eng. Shanghai Jiaotong Univ. Shanghai 200030，Dept. of Computer Science and Eng. Shanghai Jiaotong Univ. Shanghai 200030 China，Dept. of Computer Science and Eng. Shanghai Jiaotong Univ. Shanghai 200030 China，National Lab. of Modern Communications Chengdu 610041 |
| |
| 基金项目： | NationalNaturalScienceFoundationofChina(Nos.60303026,60573030,60473020)andtheFoundationofNLMC(No.51436040405JW0304) |
| |
| 摘 要： | Introduction SincethepioneeringworkduetoBonehand Franklin1],bilinearmapshavebecomeaveryfash-ionablebuildingblockandallowedtheopeningup ofcompletelynewterritoryincryptography,mak-ingitpossibletodesigncryptographicprimitives thatwerepreviouslyunknownorimpractical,for instance,identity-basedcryptosystem,ringsigna-tures,andshortsignatures,etc2-6].Therearemanyapplicationsfordigitalsigna-tureswithsmallsize,suchaslow-bandwidthcom-municationenvironments.Thefirstpairing-based shortsignatureschemepro…
|
| 关 键 词： | 符号 加密技术 网络安全 启动器 |
| 文章编号： | 1007-1172（2006）02-0230-06 |
| 收稿时间： | 2005-10-10 |
Verifiably Encrypted Signatures Without Random Oracles |
| |
| LI Xiang-xue,CHEN Ke-fei,LIU Sheng-li,LI Shi-qun.Verifiably Encrypted Signatures Without Random Oracles[J].Journal of Shanghai Jiaotong university,2006,11(2):230-235. |
| |
| Authors: | LI Xiang-xue CHEN Ke-fei LIU Sheng-li LI Shi-qun |
| |
| Abstract: | Verifiably encrypted signatures are employed when a signer wants to sign a message for a verifier but does not want the verifier to possess his signature on the message until some certain requirements of his are satisfied. This paper presented new verifiably encrypted signatures from bilinear pairings. The proposed signatures share the properties of simplicity and efficiency with existing verifiably encrypted signature schemes. To support the proposed scheme, it also exhibited security proofs that do not use random oracle assumption. For existential unforgeability, there exist tight security reductions from the proposed verifiably encrypted signature scheme to a strong but reasonable computational assumption. |
| |
| Keywords: | pairings verifiably encrypted signatures short signatures tight security reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
