{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:26:11Z","timestamp":1778297171077,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540569398","type":"print"},{"value":"9783540478263","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:53Z","timestamp":1330257353000},"page":"265-276","source":"Crossref","is-referenced-by-count":53,"title":["Secure and efficient off-line digital money (extended abstract)"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Franklin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"22_CR1","unstructured":"C. van Antwerpen, \u201cElectronic cash,\u201d Master's thesis, Eindhoven University of Technology, 1990."},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/0220068","volume":"6","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, \u201cNon-interactive zero knowledge,\u201d SIAM J. Comput. 6 (1991), 1084\u20131118.","journal-title":"SIAM J. Comput."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, \u201cHow to generate cryptographically strong sequences of pseudo random bits\u201d, SIAM J. Comput. 13, 850\u2013864, 1984.","journal-title":"SIAM J. Comput."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum, \u201cSecurity without identification: transaction systems to make big brother obsolete,\u201d CACM 28, 10 (October 1985).","journal-title":"CACM"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, A. Fiat, and M. Naor, \u201cUntraceable electronic cash,\u201d Crypto 88, pp. 319\u2013327.","DOI":"10.1007\/0-387-34799-2_25"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"I. Damgard, \u201cPayment systems and credential mechanisms with provable security against abuse by individuals,\u201d Crypto 88, pp. 328\u2013335.","DOI":"10.1007\/0-387-34799-2_26"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew directions in cryptography,\u201d IEEE Transaction on Information Theory, vol. IT-22, 1976, pp. 644\u2013654.","journal-title":"IEEE Transaction on Information Theory"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"A. De Santis and G. Persiano, \u201cCommunication efficient zero-knowledge proofs of knowledge (with applications to electronic cash),\u201d STACS 1992, pp. 449\u2013460.","DOI":"10.1007\/3-540-55210-3_204"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, and S. Micali, \u201cOn-line\/off-line digital signatures,\u201d Crypto 1989, pp. 263\u2013275.","DOI":"10.1007\/0-387-34805-0_24"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, and Y. Yacobi, \u201cElectronic Wallet,\u201d Crypto 83, pp. 383\u2013386.","DOI":"10.1007\/978-1-4684-4730-9_28"},{"issue":"No.2","key":"22_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir, \u201cZero-Knowledge Proofs of Identity,\u201d J. Cryptology, Vol. 1, No. 2, 1988, pp. 77\u201394.","journal-title":"J. Cryptology"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin, \u201cA hard-core predicate for all one-way functions,\u201d STOC 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cProofs that yield nothing but the validity of the assertion, and a methodology of cryptographic protocol design,\u201d FOCS 1986, 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"22_CR14","first-page":"644","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption,\u201d JCSS 28, pp. 644\u2013654, 1984.","journal-title":"JCSS"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe knowledge complexity of interactive proof systems,\u201d SIAM J. Comput., Vol. 18, 1989, pp. 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"J.T. Hastad, \u201cPseudo-random generators under uniform assumptions,\u201d STOC 1990, 395\u2013404.","DOI":"10.1145\/100216.100270"},{"key":"22_CR17","unstructured":"R. Hirschfeld, \u201cMaking electronic refunds safer,\u201d Crypto 1992 abstracts, 3.7\u20133.10."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Luby, \u201cOne-way functions are essential for complexity based cryptography,\u201d FOCS 1989, 236\u2013243.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby, \u201cPseudorandom generation from one-way functions,\u201d STOC 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"22_CR20","unstructured":"J. Kilian, \u201cUses of Randomness in Algorithms and Protocols,\u201d ACM Distinguished Dissertation, MIT Press, 1990."},{"key":"22_CR21","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"T. Long","year":"1988","unstructured":"T. Long and A. Wigderson, \u201cThe discrete logarithm hides O(log n) bits,\u201d SIAM J. Comput. 17, 1988, 363\u2013372.","journal-title":"SIAM J. Comput."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, \u201cUniversal one-way hash functions and their cryptographic applications,\u201d STOC 1989, pp. 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"T. Okamoto and K. Ohta, \u201cDisposable zero-knowledge authentications and their applications to untraceable electronic cash,\u201d Crypto 1989, pp. 481\u2013496.","DOI":"10.1007\/0-387-34805-0_43"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"T. Okamoto and K. Ohta, \u201cUniversal electronic cash,\u201d Crypto 1991, pp. 324\u2013337.","DOI":"10.1007\/3-540-46766-1_27"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner, \u201cHow to break and repair a \u2018provably secure\u2019 untraceable payment system,\u201d Crypto 91, pp. 338\u2013350.","DOI":"10.1007\/3-540-46766-1_28"},{"key":"22_CR26","first-page":"155","volume-title":"Foundations of Secure Computation","author":"M. Rabin","year":"1978","unstructured":"M. Rabin, \u201cDigital signatures,\u201d in Foundations of Secure Computation, R. DeMillo, D. Dobkin, A. Jones, and R. Lipton (editors), Academic Press, NY, 1978, 155\u2013168."},{"key":"22_CR27","unstructured":"M. Rabin, \u201cHow to exchange secrets by oblivious transfer,\u201d Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"22_CR28","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems,\u201d CACM, vol. 21, 1978, pp. 120\u2013126.","journal-title":"CACM"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"J. Rompel, \u201cOne-way functions are necessary and sufficient for secure signatures,\u201d STOC 1990, pp. 387\u2013394.","DOI":"10.1145\/100216.100269"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cHow to generate and exchange secrets,\u201d FOCS 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:32Z","timestamp":1605647252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}