A Digital Cash Protocol Based on Additive Zero Knowledge

1. Wiles, A.: Modular elliptic curves and Fermat’s last theorem. AM 141(3), 443–551 (1995)

   MATH  MathSciNet  Google Scholar 

2. Goldreich, O.: Zero-knowledge twenty years after its invention (2002)

   Google Scholar 

3. Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. Journal of Cryptology 7(1), 1–32 (1994)

   Article  MATH  MathSciNet  Google Scholar 

4. Goldreich, O.: Foundations of Cryptography. volume Basic Tools. Cambridge University Press, Cambridge (2001)

   Book  MATH  Google Scholar 

5. Goldwasser, S.: New directions in cryptography: Twenty some years later (or cryptography and complexity theory: A match made in heaven). In: 38th Annual Symposium on Foundations of Computer Science, pp. 314–324. IEEE, Los Alamitos (1997)

   Chapter  Google Scholar 

6. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 103–112. ACM Press, New York (1988)

   Chapter  Google Scholar 

7. Blum, M., Santis, A.D., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084–1118 (1991)

   Article  MATH  MathSciNet  Google Scholar 

8. Bellare, M., Goldwasser, S.: New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 194–211. Springer, Heidelberg (1990)

   Google Scholar 

9. Feige, U., Lapidot, D., Shamir, A.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1–28 (2000)

   Article  MathSciNet  Google Scholar 

10. Camenisch, J., Maurer, U.M., Stadler, M.: Digital payment systems with passive anonymity-revoking trustees. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol. 1146, pp. 33–43. Springer, Heidelberg (1996)

    Google Scholar 

11. Panurach, P.: Money in electronic commerce: digital cash, electronic fund transfer, and ecash. Commun. ACM 39(6), 45–50 (1996)

    Article  Google Scholar 

12. Rabi, M., Sherman, A.T.: An observation on associative one-way functions in complexity theory. Inf. Process. Lett. 64(5), 239–244 (1997)

    Article  MathSciNet  Google Scholar 

13. Saxena, A., Soh, B.: A new paradigm for group cryptosystems using quick keys. In: Proceedings of the The 11th IEEE International Conference on Networks (ICON 2003), Sydney, Australia, pp. 385–389 (2003)

    Google Scholar 

14. Hemaspaandra, L.A., Rothe, J., Saxena, A.: Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for one-way functions in complexity theory. Technical Report UR CSD;854, University of Rochester, December 2004 (2004)

    Google Scholar 

15. Hemaspaandra, L.A., Pasanen, K., Rothe, J.: If p ≠ np then some strongly noninvertible functions are invertible. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 162–171. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

16. Saxena, A., Soh, B.: Contributory approaches to centralized key agreement in dynamic peer groups. In: Proceedings of the The 11th IEEE International Conference on Networks (ICON 2003), Sydney, Australia, pp. 397–402 (2003)

    Google Scholar 

17. Saxena, A., Soh, B.: A novel method for authenticating mobile agents with one-way signature chaining. In: Proceedings of The 7th International Symposium on Autonomous Decentralized Systems (ISADS 2005), China (2005) (to appear)

    Google Scholar 

18. Saxena, A., Soh, B.: Authenticating mobile agent platforms using signature chaining without trusted third parties. In: Proceedings of The 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE 2005), Hong kong (2005) (to appear)

    Google Scholar 

Download references