1. Asokan N, Shoup V, Waidner M. Optimistic fair exchange of digital signatures. Advances in cryptology: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT’98), May 31-Jun 4, 1998, Espoo, Finland. LNCS 1403. Berlin, Germany: Springer-Verlag, 1998: 591-606
2. Dodis Y, Reyzin L. Breaking and repairing optimistic fair exchange from PODC 2003. Proceedings of the ACM Workshop on Digital Rights Management (DRM’03), Oct 27, 2003, Washington, DC, USA. New York, NY, USA: ACM, 2003: 47-54
3. Park J M, Chong E, Siegel H, et al. Constructing fair-exchange protocols for e-commerce via distributed computation of RSA signatures. Proceeding of the 22nd Annual Symposium on Principles of Distributed Systems (PODC’03), Jul 13-16, 2003, Boston, MA, USA. New York, NY, USA: ACM, 2003: 172-181
4. Zhou J, Deng R, Bao F. Some remarks on a fair exchange protocol. Public Key Cryptography: Proceeding of the 3rd International Workshop on Practice and Theory in Public Key Cryptosystems (PKC’00), Jan 18-20, 2000, Melbourne, Australia. LNCS 1751. Berlin, Germany: Springer- Verlag, 2000: 46-57
5. Garay J, Pomerance C. Timed fair exchange of standard signatures. Proceedings of the 7th International Conference on Financial Cryptography (FC’03), Jan 27-30, 2003, Guadeloupe, French West Indies. LNCS 2742. Berlin, Germany: Springer-Verlag, 2003: 190-207
6. Ateniese G. Efficient verifiable encryption (and fair exchange) of digital signatures. Proceedings of the 6th ACM Conference on Computer and Communications Security, Nov 1-4, 1999, Singapore. New York, NY, USA: ACM, 1999: 138-146
7. Fan C, Liang Y, Lin B. Fair transaction protocols based on electronic cash. Proceedings of the 7th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT’06), Dec 4-7, 2006, Taipei, China. Los Alamitos, CA, USA: IEEE Computer Society, 2006: 383-388
8. Lin S, Liu D. An incentive-based electronic payment scheme for digital content transactions over the Internet. Journal of Network and Computer Applications, 2009, 32(3): 589-598
9. Stadler M. Publicly verifiable secret sharing. Advances in Cryptology: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT’96), May 12-16, 1996, Zaragoza, Spain. LNCS 1070. Berlin, Germany: Springer-Verlag, 1996: 190-199
10. Mao W. Publicly verifiable partial key escrow. Proceeding of the 2nd Australasian Conference on Information Security and Privacy (ACISP’97), Jul 7-9, 1997, Syndey, Australia. Berlin, Germany: Springer-Verlag, 1997: 240-248
11. Bao F, Deng R H, Mao W. Efficient and practical fair exchange protocols with off-line TTP. Proceeding of IEEE Symposium on Security and Privacy, May 3-6, 1998, Oakland, CA, USA. Piscataway, NJ, USA: IEEE, 1998: 77-85
12. Boyd C, Foo E. Off-line fair payment protocols using convertible signature. Advances in Cryptology: Proceeding of International Conference on the Theory and Applications of Cryptology and Information Security(ASIACRYPT’98), Oct 18-22, 1998, Beijing, China. LNCS 1514. Berlin, Germany: Springer-Verlag, 1998: 271-285
13. Chaum D. Blind signatures for untraceable payments. Proceedings of International Cryptology Conference (Crypto’82), Aug 23-25, 1982, Santa Barbara, CA, USA.New York, NY, USA: Plenum Press, 1982, 199-203
14. Hazay C, Katz J, Koo C, et al. Concurrently-secure blind signatures without random oracles or setup assumptions. Proceedings of the 4th Theory of Cryptology Conference (TCC’07), Feb 21-24,2007. Amsterdam, The Netherlands. LNCS 4392. Berlin, Germany: Springer- Verlag, 2007: 323-341
15. Kiayias A, Zhou H. Concurrent blind signatures without random oracles. Proceedings of the 5th International Conference on Security and Cryptography for Networks (SCN’06), Sep 6-8, 2006, Maiori, Italy. LNCS 4116. Berlin, Germany: Springer-Verlag, 2006: 49-62
16. Chaum D. Security without identification: transaction systems to make big brother obsolete. Communications of ACM, 1985, 28(10): 1030-1044
17. Nyberg K, Rueppel R A. A new signature scheme based on the DSA giving message recovery. Proceeding of the 1st ACM Conference on Computer and Communications Security (CCCS’93), Nov 3-5, Fairfax, VA, USA. New York, NY, USA: ACM, 1993: 58-61
18. Camenisch J L, Piveteau J M, Stadler M A. Blind signature based on the discrete logarithm problem. Advances in Cryptology: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT’95), May 21-25, 1995, Saint-Malo, France. LNCS 921. Berlin, Germany: Springer- Verlag, 1995: 428-432
|