An efficient secure proxy verifiably encrypted signature scheme

Journal of Network and Computer Applications

Volumn 33, Issue 1, 2010, Pages 29-34

  Zhang, Jianhong ^a,b   Liu, Chenglian ^c   Yang, Yixian ^b  

^a NORTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Proxy verifiably encrypted signature; Random oracle; Security model; The CDH problem

Indexed keywords

BUILDING BLOCKES; CIPHERTEXTS; CRYPTOGRAPHIC PRIMITIVES; DIFFIE-HELLMAN PROBLEM; FAIR EXCHANGE; NEW CONCEPT; PROVABLY SECURE; PROXY SIGNATURES; PROXY VERIFIABLY ENCRYPTED SIGNATURE; RANDOM ORACLE; RANDOM ORACLE MODEL; SECURITY MODEL; THE CDH PROBLEM; VERIFIABLY ENCRYPTED SIGNATURES;

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

NETWORK SECURITY;

EID: 70349840877     PISSN: 10848045     EISSN: 10958592     Source Type: Journal    
DOI: 10.1016/j.jnca.2009.07.003     Document Type: Article

References (26)

1. Asokan N., Shoup V., and Waidner M. Optimistic fair exchange of digital signature (extended abstract). Advances in cryptology-eurocrypt'98. Lecture Notes in Computer Science vol. 1403 (1998), Springer, Berlin 591-606
2. Ateniese G. Efficient verifiable encryption (and fair exchange) of digital signatures. In: Proceedings of the 6th conference on CCS. New York: ACM; 1999. p. 138-46.
3. Ateniese G. Verifiable encryption of digital signature and applications. ACM Transactions on Information and System Security 7 1 (2004) 1-20
4. Ballare M, Rogaway P. Random oracle are practical: a paradigm for designing efficient protocols. In: First ACM conference on computer and communications Security. New York: ACM; 1993.
5. Bao F, Deng RH, Mao W. Efficient and practical fair exchange protocols with off-line TTP. In: IEEE symposium on security and privacy. Oakland, CA, 1998. p. 349-54.
6. Boldyreva A, Palacio A, Warinschi B. Secure proxy signature schemes for delegation of signing right. Manuscript available at: 〈http://eprint.iacr.org/2003/096〉.
7. Boneh D., Gentry C., Lynn B., and Shacham H. Aggregate and verifiably encrypted signatures from bilinear maps. Advances in cryptolog-eurocrypt'03, Lecture Notes in Computer Science vol. 2656 (2003), Springer, Berlin 416-432
8. Boneh D., Lynn B., and Shacham H. Short signatures from the Weil pairing. Journal of Cryptology 17 4 (2004) 297-319
9. Camenisch J, Damgard I. Verifiable encryption group encryption and their application to separable group signatures and signature sharing schemes. In: ASIACRYPT2000, Lecture Notes in Computer Science, vol. 1976. Berlin: Springer; 2000. p. 331-45.
10. Camenisch J, Shoup V. Practical verifiable encryption and decryption of discrete logarithms. In: CRYPTO 2003, Lecture Notes in Computer Science, vol. 2729. Berlin: Springer; 2003. p. 126-44.
11. Cha JC, Cheon JH. An identity-based signature from gap Diffie-Hellman groups. In: Proceedings of the 6th international workshop on theory and practice in public key cryptography: public key cryptography, 2003. p. 18-30.
12. Chen TS, Liu TP, Chung YF. A proxy-protected proxy signature scheme based on elliptic curve cryptosystem. In: TENCON 02, Proceedings. 2002 IEEE region 10 conference on computers, communications, control and power engineering, 2002. p. 184-7.
13. Cheng XG, Liu JM, Wang XM. Identity-based aggregate and verifiably encrypted signatures from bilinear pairing. In: ICCSA 2005, Lecture Notes in Computer Science, vol. 3483. Berlin: Springer; 2005. p. 1046-54.
14. Choudary Gorantla M, Saxena A. Verifiably encrypted signature without random oracles. In: ICDCIT 2005, Lecture Notes in Computer Science, vol. 3816. Berlin: Springer; 2005. p. 357-63.
15. Foster I, Kesselman C, Tsudik G, Tuecke S. A security architecture for computational grids. In: 5th ACM conference on computers and communications security, 1998.
16. Gamage C, Leiwo J, Zheng Y. An efficient scheme for secure message transmission using proxy-signcryption. In: Edwards J, editor, Proceedings of the 22th Australasian computer science. Auckland: Springer; 1999. p. 420-31.
17. Goldwasser S., Micali S., and Rivest R.L. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17 2 (1988) 281-308
18. Gu CX, Zhu YF. An ID-based verifiable encrypted signature scheme based on Hess's scheme. In: CISC 2005, Lecture Notes in Computer Science, vol. 3822. Berlin: Springer; 2005. p. 42-52.
19. Hess F. Efficient identity based signature schemes based on pairing. In: SAC 2002, Lecture Notes in Computer Science, vol. 2595. Berlin: Springer; 2002. p. 310-24.
20. Kim H, Beak J, Lee B, Kim K. Secret computation with secrets for mobile agent using one-time proxy signatures. In: Cryptography and information security 2001, 2001.
21. Lee B, Kim H, Kim K. Strong proxy signature and its applications. In: Proceedings of SCIS, 2001.
22. Mambo M, Usuda K, Okamoto E. Proxy signatures for delegating signing operation. In: Proceedings of the 3rd ACM conference on computer and communications security (CCS). New York: ACM; 1996, p. 48-57.
23. Park H-U, Lee L-Y. A digital nominative proxy signature scheme for mobile communications. In: ICICS 2001, Lecture Notes in Computer Science, vol. 2229. Berlin: Springer; 2001. p. 451-5.
24. Pointcheval D., and Stern J. Security arguments for digital signatures and blind signatures. Journal of Cryptology 13 3 (2000) 361-396
25. Shamir A. Identity-based cryptosystem and signature schemes. In: Advanced in cryptology-crypto'84, Lecture Notes in Computer Science, vol. 196. Berlin: Springer; 1985. p. 47-53.
26. Zhang F, Safavi-Naini R, Susilo W. Efficient verifiably encrypted signature and partially blind signature from bilinear pairings. In: Progress in cryptology-indocrypt'03, Lecture Notes in Computer Science, vol. 2904. Berlin: Springer; 2003. p. 191-204.