Efficient verifiably encrypted signature and partially blind signature from bilinear pairings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2904, Issue , 2003, Pages 191-204

  Zhang, Fangguo ^a   Safavi Naini, Reihaneh ^a   Susilo, Willy ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Bilinear pairings; Partially blind signature; Verifiably encrypted signature

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ELECTRONIC MONEY; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

BILINEAR PAIRING; BLIND SIGNATURE SCHEME; FAIR EXCHANGE; PARTIALLY BLIND SIGNATURE SCHEME; PARTIALLY BLIND SIGNATURES; VERIFIABLY ENCRYPTED SIGNATURES;

AUTHENTICATION;

EID: 0348155942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24582-7_14     Document Type: Article

References (26)

1. M. Abe and E. Fujisaki, How to date blind signatures, Advances in Cryptology - Asiacrypt 1996. LNCS 1163, pp. 244-251, Springer-Verlag, 2002.
2. M. Abe and T. Okamoto, Provably secure partially blind signatures, Advances in Cryptology - CRYPTO 2000. LNCS 1880, pp. 271-286, Springer-Verlag, 2000.
3. N. Asokan, V. Shoup and M. Waidner, Optimistic fair exchange of digital signatures. IEEE J. Selected Areas in Comm., 18(4):593-610, April 2000.
4. F. Bao, R. Deng and W. Mao. Efficient and practical fair exchange protocols with offline TTP. In Proceedings of IEEE Symposium on Security and Privacy, pp. 77-85, 1998.
5. P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott, Efficient algorithms for pairing-based cryptosystems, Advances in Cryptology-Crypto 2002, LNCS 2442, pp.354-368, Springer-Verlag, 2002.
6. P.S.L.M. Barreto, B. Lynn, and M. Scott, On the selection of pairing-friendly groups, to appear in the Workshop on Selected Areas in Cryptography (SAC) 2003.
7. A. Boldyreva, Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman -group signature scheme, Public Key Cryptography - PKC 2003, LNCS 2139, pp.31-46, Springer-Verlag, 2003.
8. D. Boneh, The decision Diffie-Hellman problem, Proceedings of the Third Algorithmic Number Theory Symposium, LNCS 1423, pp. 48-63, Springer-Verlag, 1998.
9. D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, Advances in Cryptology-Crypto 2001, LNCS 2139, pp.213-229, Springer-Verlag, 2001.
10. D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, Eurocrypt 2003, LNCS 2656, pp.272-293, Springer-Verlag, 2003.
11. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, In C. Boyd, editor, Advances in Cryptology-Asiacrypt 2001, LNCS 2248, pp.514-532, Springer-Verlag, 2001.
12. J.C. Cha and J.H. Cheon, An identity-based signature from gap Diffie-Hellman groups, Public Key Cryptography - PKC 2003, LNCS 2139, pp.18-30, Springer-Verlag, 2003.
13. D. Chaum, Blind signatures for untraceable payments, Advances in Cryptology-Crypto 82, Plenum, NY, pp.199-203, 1983.
14. C.I. Fan and C.L. Lei, Low-computation partially blind signatures for electronic cash, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E81- A(5) (1998) 818-824.
15. S. D. Galbraith, K. Harrison, and D. Soldera, Implementing the Tate pairing, ANTS 2002, LNCS 2369, pp.324-337, Springer-Verlag, 2002.
16. F. Hess, Efficient identity based signature schemes based on pairings, SAC 2002, LNCS 2595, pp.310-324, Springer-Verlag, 2002.
17. A. Joux, A one round protocol for tripartite Diffie-Hellman, ANTS IV, LNCS 1838, pp.385-394, Springer-Verlag, 2000.
18. U. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, Advances in Cryptology-Crypto 94, LNCS 839, pp.271-281, Springer-Verlag, 1994.
19. S. Mitsunari, R. Sakai and M. Kasahara, A new traitor tracing, IEICE Trans. Vol. E85-A, No.2, pp.481-484, 2002.
20. D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures, Journal of Cryptology, Vol.13, No.3, pp.361-396, 2000.
21. R. Sakai, K. Ohgishi and M. Kasahara, Cryptosystems based on pairing, SCIS 2000-C20, Jan. 2000. Okinawa, Japan.
22. R. Sakai and M. Kasahara, Cryptosystems based on pairing over elliptic curve, SCIS 2003, 8C-1, Jan. 2003. Japan. This paper is available at Cryptology ePrint Archive, http://eprint.iacr.org/2003/054/.
23. N.P. Smart, An identity based authenticated key agreement protocol based on the Weil pairing, Electron. Lett., Vol.38, No.13, pp.630-632, 2002.
24. E. Verheul, Self-blindable credential certificates from the Weil pairing, Advances in Cryptology - Asiacrypt'2001, LNCS 2248, pp. 533-551, Springer-Verlag, 2001.
25. F. Zhang and K. Kim, ID-based blind signature and ring signature from pairings, Proc. of Asiacrpt2002, LNCS 2501, pp. 533-547, Springer-Verlag, 2002.
26. F. Zhang, R. Safavi-Naini and W. Susilo, An efficient signature scheme from bilinear pairings and its applications, Manuscript, 2003.