參考文獻 |
[1] M. Abadi, N. Glew, B. Horne, and B. Pinkas, "Certified e-mail with a light
on-line trusted third party: Design and implementation," Proc. of the 11th
International World Wide Web Conference, WWW 2002, Honolulu, Hawaii,
USA, May 2002.
[2] M. Abe, M. Ohkubo, and K. Suzuki, "1-out-of-n signatures from a variety of
keys," Advances in Cryptology - ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp.415-432, Springer-Verlag, 2002.
[3] R. Anderson, C. Manifavas, and C. Sutherland, "NetCard - A practical electronic cash system," Proc. of Security Protocols Workshop, Lecture Notes in
Computer Science 1189, pp.49-57, Springer-Verlag, 1997.
[4] N. Asokan, V. Shoup, and M. Waidner, "Optimistic fair exchange of digital
signatures," Advances in Cryptology - EUROCRYPT 1998, Lecture Notes in
Computer Science 1403, pp.591-606, Springer-Verlag, 1998.
[5] E.F. Brickell, D. Chaum, I.B. Damgard, and J. van de Graaf, "Gradual and
verifiable release of a secret," Advances in Cryptology - CRYPTO 1987, pp.156-166.
[6] C. Cachin, "Efficient private bidding and auctions with an oblivious third
party," Proc. of the 6th ACM Conference on Computer and Communications
Security, pp.120-127, 1999.
[7] C. Cachin and J. Camenisch, "Optimistic fair secure computation," Advances in Cryptology - CRYPTO 2000, Lecture Notes in Computer Science 1880, pp.94-112, Springer-Verlag, 2000.
[8] J. Camenisch, "Efficient and generalized group signatures," Advances in Cryptology - EUROCRYPT 1997, Lecture Notes in Computer Science 1233, pp.465-479, Springer-Verlag, 1998.
[9] L. Chen, C. Kudla, and K.G. Paterson, "Concurrent signatures," Advances in
Cryptology - EUROCRYPT 2004, Lecture Notes in Computer Science 3027,
pp.287-305, Springer-Verlag, 2004.
[10] S.S.M. Chow and W. Susilo, "Generic construction of (identity-based) perfect concurrent signatures," Proc. of Information and Communications Security Conference, ICICS 2005, Lecture Notes in Computer Science 3783, pp.194-206, Springer-Verlag, 2005.
[11] R. Cleve, "Controlled gradual disclosure schemes for random bits and their applications," Advances in Cryptology - CRYPTO 1989, Lecture Notes in Computer Science 435, pp.573-588, Springer-Verlag, 1990.
[12] I.B. Damgard, "Practical and provably secure release of a secret and exchange of signatures," Advances in Cryptology - EUROCRYPT 1993, Lecture Notes
in Computer Science, pp.200-217, Springer-Verlag, 1994.
[13] T. ElGamal, "A public key cryptosystem and a signature scheme based on
discrete logarithms," IEEE Transactions on Information Theory, 31, pp.469-472, 1985.
[14] S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing
contracts," Communications of the ACM, Vol.28(6), pp.637-647, Jun. 1985.
[15] M.K. Franklin and M.K. Reiter, "Fair exchange with a semi-trusted third
party," Proc. of the 4th ACM Conference on Computer and Communications
Security, pp.1-5, 1997.
[16] M.K. Franklin and G. Tsudik, "Secure group barter: Multi-party fair exchange with semi-trusted neutral parties," Proc. of Financial Cryptography Conference, FC 1998, Lecture Notes in Computer Science 1465, pp.90-102, Springer-Verlag, 1998.
[17] J.A. Garay, M. Jakobsson, and P. MacKenzie, "Abuse-free optimistic contract signing," Advances in Cryptology - CRYPTO 1999, Lecture Notes in Computer Science 1666, pp.449-466, Springer-Verlag, 1999.
[18] S. Glassmann, M. Manasse, M. Abadi, P. Gauthier, and P. Sobalvarro, "The
Millicent protocol for inexpensive electronic commerce," Proc. of 4th International World Wide Web Conference, pp.603-618, 1995.
[19] O. Goldreich, "A simple protocol for signing contracts," Advances in Cryptology - CRYPTO 1983, Lecture Notes in Computer Science, pp.133-136, Springer-Verlag, 1983.
[20] O. Goldreich, "Sending certified mail using oblivious transfer and a threshold scheme," Technical Report, Computer Science Department, Israel Institute of Technology, 1984.
[21] N.M. Haller, "The S/KEY one-time password system," Proc. of the ISOC Symposium on Network and Distributed System Security, San Diego, CA, Feb. 1994.
[22] R. Hauser, M. Steiner, and M. Waidner, "Micropayments based on iKP," Proc.
of SECURICOM 1996, 14th Worldwide Congress on Computer and Communications Security and Protection, pp.67-82, Jun. 1996.
[23] M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated verifier proofs and
their applications," Advances in Cryptology - EUROCRYPT 1996, Lecture Notes in Computer Science 1070, pp.143-154, Springer-Verlag, 1996.
[24] C. Jutla and M. Yung, "Paytree: Amortized signature for flexible micropayments," Proc. of 2nd USENIX Workshop on Electronic Commerce, pp.213-221, Nov. 1996.
[25] M. Klonowski, M. Kutylowski, A. Lauks, and F. Zagorski, "Conditional digital signatures," Proc. of Trust, Privacy and Security in Digital Business Conference, TrustBus 2005, Lecture Notes in Computer Science 3592, pp.206-215,
Springer-Verlag, 2005.
[26] L. Lamport, "Password authentication with insecure communication," Communications of the ACM, Vol.24(11), pp.770-772, Nov. 1981.
[27] B. Lee and K. Kim, "Fair exchange of digital signatures using conditional signature," Symposium on Cryptography and Information Security, SCIS 2002,
Vol.1/2, pp.179-184, 2002.
[28] S. Micali and R.L. Rivest, "Micropayments revisited," Proc. of Cryptographer's Track at the RSA Conference, CT-RSA 2002, Lecture Notes in Computer Science 2271, pp.149-163, Springer-Verlag, 2002.
[29] K. Nguyen, "Asymmetric concurrent signatures," Proc. of Information and
Communications Security Conference, ICICS 2005, Lecture Notes in Computer
Science 3783, pp.181-193, Springer-Verlag, 2005.
[30] T. Pedersen, "Electronic payments of small amounts," Proc. of Security Protocols Workshop, Lecture Notes in Computer Science 1189, pp.59-68, Springer-Verlag, 1997.
[31] B. Pfitzmann, M. Schunter, and M. Waidner, "Optimal efficiency of optimistic contract signing," Proc. of the 7th Annual ACM Symposium on Principles of Distributed Computing, pp.113-122, 1998.
[32] R.L. Rivest, "The MD5 message digest algorithm," RFC 1321, Apr. 1992.
[33] R.L. Rivest, "Electronic lottery tickets as micropayments," Proc. of Financial Cryptography Conference, FC 1997, Lecture Notes in Computer Science 1318, pp.307-314, Springer-Verlag, 1998.
[34] R.L. Rivest and A. Shamir, "PayWord and MicroMint: Two simple micropayment schemes," Proc. of Security Protocols Workshop, Lecture Notes in
Computer Science 1189, pp.69-87, Springer-Verlag, 1997.
[35] R.L. Rivest, A. Shamir, and L.M. Adleman, "A method for obtaining digital
signatures and public-key cryptosystems," Communications of the ACM, 21(2),
pp.120-126, 1978.
[36] R.L. Rivest, A. Shamir, and Y. Tauman, "How to leak a secret," Advances
in Cryptology - ASIACRYPT 2001, Lecture Notes in Computer Science 2248,
pp.552-565, Springer-Verlag, 2001.
[37] C.P. Schnorr, "Efficient identification and signatures for smart cards," Advances in Cryptology - CRYPTO 1989, Lecture Notes in Computer Science
435, pp.239-252, Springer-Verlag, 1990.
[38] J. Stern and S. Vaudenay, "SVP: A flexible micropayment scheme," Proc. of Financial Cryptography Conference, FC 1997, Lecture Notes in Computer Science
1318, pp.161-172, Springer-Verlag, 1998.
[39] W. Susilo, Y. Mu, and F. Zhang, "Perfect concurrent signature schemes," Proc. of Information and Communications Security Conference, ICICS 2004, Lecture Notes in Computer Science 3269, pp.14-26, Springer-Verlag, 2004.
[40] S.M. Yen, "PayFair: A prepaid Internet micropayment scheme ensuring customer fairness," IEE Proceedings: Computers and Digital Techniques, Vol.148,
No.6, pp.207-213, Nov. 2000.
[41] S.M. Yen, C.N. Chen, and H.C. Lin, "Improved probabilistic micropayment
scheme," Proc. of International Workshop on Information Security Applications, WISA 2002, Jeju Island, Korea, Aug. 2002.
[42] S.M. Yen, L.T. Ho, and C.Y. Huang, "Internet micropayment based on unbalanced one-way binary tree," Proc. of International Workshop on Cryptographic Techniques and E-Commerce, CrypTEC 1999, Hong Kong, pp.155-162,
Jul. 1999.
[43] S.M. Yen and C.S. Laih, "Improved digital signature suitable for batch verification," IEEE Trans. on Computers, Vol.44, No.7, Jul. 1995.
[44] S.M. Yen, C.S. Laih, and A.K. Lenstra, "Multi-exponentiation," IEE Proceedings: Computers and Digital Techniques, Vol.141, No.6, pp.325-326, Nov. 1994.
[45] S.M. Yen and Y. Zheng, "Weighted one-way hash chain and its applications,"
Proc. of International Workshop on Information Security, ISW 2000, Lecture
Notes in Computer Science 1975, pp.135-148, Springer-Verlag, 2000.
[46] Y. Zheng, J. Pieprzyk, and J. Seberry, "HAVAL - A one-way hashing algorithm with variable length of output," Advances in Cryptology - AUSCRYPT 1992, Lecture Notes in Computer Science 718, pp.83-104, Springer-Verlag, 1993.
[47] FIPS 180-1, "Secure Hash Standard," NIST, US Department of Commerce,
Washington D.C., Apr. 1995. |