Secure and efficient off-line digital money

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

Volumn 700 LNCS, Issue , 1993, Pages 265-276

  Franklin, Matthew ^a   Yung, Moti ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; ELECTRONIC MONEY; ROBOTS;

COMMUNICATION COMPLEXITY; ENCRYPTION OPERATIONS; LOW DEGREE; PRE-PROCESSING; PROVABLY SECURE;

CRYPTOGRAPHY;

EID: 84944906479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56939-1_78     Document Type: Conference Paper

References (30)

1. C. van Antwerpen, “Electronic cash,” Master’s thesis, Eindhoven University of Technology, 1990.
2. M. Blum, A. De Santis, S. Micali, and G. Persiano, “Non-interactive zero knowledge,” SIAM J. Comput. 6 (1991), 1084-1118.
3. M. Blum and S. Micali, “How to generate cryptographlcally strong sequences of pseudo random bits”, SIAM J. Comput. 13, 850-864-1984.
4. D. Chaum, “Security without identification: transaction systems to make big brother obsolete,” CACM 28, 10 (October 1985).
5. D. Ckaum, A. Fiat, and M. Naor, “Untraceable electronic cash”, Crypto 88, pp. 319-327.
6. I. Damgärd Payment systems and credential mechanisms with provable security against abuse by individuals,” Crypto 88, pp. 328-335.
7. W. Diffie and M. Hellman, “New directions in cryptography, IEEE Transaction on Information Theory, vol. IT-22, 1976, pp. 644-654.
8. A. De Santis and G. Persiano, “Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash),” STAGS 1992, pp. 449-460.
9. S. Even, O. Goldreieh, and S. Mieali, “On-line/off-line digital signatures,” Crypto 1989, pp. 263-275.
10. S. Even, O. Goldreich, and Y. Yaeobi, “Electronic Wallet, Crypto 83, pp. 383-386.
11. U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity,” J. Cryptology, Vol. 1, No. 2, 1988, pp. 77-94.
12. O. Goldreich and L. Levin, “A hard-core predicate for all one-way functions,” STOC 1989, pp. 25-32.
13. O. Goldreich, S. Mieali, and A. Wigderson, “Proofs that yield nothing but the validity of the assertion, and a methodology of cryptographic protocol design,” FOGS 1986, 174-187.
14. S. Goldwasser and S. Micali, “Probabilistie encryption,” JCSS 28, pp. 644-654, 1984.
15. S. Goldwasser, S. Mieali, and C. Rackoff, “The knowledge complexity of interactive proof systems,” SIAM J. Gomput., Vol. 18, 1989, pp. 186-208.
16. J.T. Ifastad, “Pseudo-random generators under uniform assumptions,” STOC 1990. 395-404.
17. R. Hirschfeld, “Making electronic refunds safer,” Crypto 1992 abstracts, 3.7-3.10.
18. K. Impagliazzo and M. Luby, “One-way functions are essential for complexity based cryptography,” FOGS 1989, 236-243.
19. K. Impagliazzo, L. Levin, and M. Luby, “Pseudorandom generation from one-way functions,” STOC 1989, pp. 12-24.
20. J. Kilian, “Uses of ltandomness in Algorithms and Protocols,” ACM Distinguished Dissertation, MIT Press, 1990.
21. T. Long and A. Wigderson, “The discrete logarithm hides O(log n) bits,” SIAM J. Gomput. 17, 1988, 363-372.
22. M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications,” STOC 1989, pp. 33-43.
23. T. Okamoto and K. Ohta, “Disposable zero-knowledge authentications and their applications to untraceable electronic cash, Crypto 1989, pp. 481-496.
24. T. Okamoto and K. Ohta, “Universal electronic cash,” Crypto 1991, pp. 324-337.
25. B. Pfitzmann and M. Waldner, “How to break and repair a ‘provably secure’ untraceable payment system,” Crypto 91, pp. 338-350.
26. M. Rabin, Digital signatures,” in Foundations of Secure Computation, R. DeMillo, D. Dobkin, A. Jones, and R. Lipton (editors), Academic Press, NY, 1978, 155-188.
27. M. Rabln, “Ilow to exchange secrets by oblivious transfer,” Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
28. R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosysterns,” CAGM, vol. 21, 1978, pp. 120-126.
29. J. Rompel, “One-way functions are necessary and sufficient for secure signatures,” STOC 1990, pp. 387-394.
30. A. Yaoj “Itow to generate and exchange secrets,” FOGS 1986 pp. 162-167.