Verifiably Encrypted Signatures Without Random Oracles  

作　　者：李祥学 陈克非 刘胜利 李世群 

机构地区：[1]Dept. of Computer Science and Eng., Shanghai Jiaotong Univ., Shanghai 200030, China,School of Information Security Eng., Shanghai Jiaotong Univ., Shanghai 200030 [2]Dept. of Computer Science and Eng., Shanghai Jiaotong Univ., Shanghai 200030, China [3]National Lab. of Modern Communications, Chengdu 610041

出　　处：《Journal of Shanghai Jiaotong university(Science)》2006年第2期230-235,共6页上海交通大学学报（英文版）

基　　金：NationalNaturalScienceFoundationofChina(Nos.60303026,60573030,60473020)andtheFoundationofNLMC(No.51436040405JW0304)

摘　　要：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.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.

关 键 词：PAIRINGS verifiably encrypted signatures short signatures tight security reduction 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]