Forgeability of Wang-Tang-Li’s ID-Based Restrictive Partially Blind Signature Scheme-Reference-Cited by-同舟云学术

Forgeability of Wang-Tang-Li’s ID-Based Restrictive Partially Blind Signature Scheme

Published:2008-03 Issue:2 Volume:23 Page:265-269
ISSN:1000-9000
Container-title:Journal of Computer Science and Technology
language:en
Short-container-title:J. Comput. Sci. Technol.

Author:

Liu Sheng-Li,Chen Xiao-Feng,Zhang Fang-Guo

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11390-008-9128-9.pdf

Reference17 articles.

1. Chaum D. Blind signatures for untraceable payments. In Proc. Crypto’82, Rivest R L, Sherman A, Chaum D (eds.), New York: Santa Barbara, California, USA, Plenum Press, 1983, pp.199–203.

2. Brands S. Untraceable off-line cash in wallet with observers. In Proc. Advances in Cryptology (Crypto93), Stinson D R (ed.), Santa Barbara, California, USA, Lecture Notes in Computer Science, Vol. 773, Springer-Verlag, Berlin, Heidelberg, New York, 1993, pp.302–318.

3. Chan A, Frankel Y, Tsiounis Y. Easy come easy go divisible cash. In Proc. Advances in Cryptology (EUROCRYPT 98), Kaisa Nyberg (ed.), Espoo, Finland, Lecture Notes in Computer Science, Vol. 1403, Springer-Verlag, 1998, pp.561–576.

4. Boyd C, Foo E, Pavlovski C. Efficient electronic cash using batch signatures. In Proc. Australasian Conference on Information Security and Privacy (ACISP’99), Pieprzyk J, Safavi-Naini R, Seberry J (eds.), Wollongong, NSW, Australia, Lecture Notes in Computer Science, Vol. 1587, Springer-Verlag, 1999, pp.244–257.

5. Nyang D, Song J. Preventing double-spent coins from revealing user’s whole secret. In Proc. Second International Conference on Information Security and Cryptology (ICISC’99), Song J S (ed.), Seoul, Korea, Lecture Notes in Computer Science, Vol. 1787, Springer-Verlag, 1999, pp.13–20.