{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:44Z","timestamp":1725475724897},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679233"},{"type":"electronic","value":"9783540445340"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721064_18","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T17:53:12Z","timestamp":1167414792000},"page":"203-212","source":"Crossref","is-referenced-by-count":0,"title":["How to Say \u201cYES\u201d with Smart Cards"],"prefix":"10.1007","author":[{"given":"Yair","family":"Frankel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Burrows, M., Kaufman, C., Lampson, B.: Authentication and Delegation with Smart-Cards. DEC Systems Research Center\u00a067 (October 1990)","DOI":"10.1007\/3-540-54415-1_53"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: Hash functions which hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC 1998), pp. 131\u2013140 (1998)","DOI":"10.1145\/276698.276721"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Van Antwerpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013216. Springer, Heidelberg (1990)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"D. Chaum","year":"1991","unstructured":"Chaum, D.: Zero-knowledge undeniable signatures. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 458\u2013464. Springer, Heidelberg (1991)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48184-2_18","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"G. Davida","year":"1988","unstructured":"Davida, G., Matt, B.: Arbitration in tamper proof devices. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 216\u2013222. Springer, Heidelberg (1988)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"Y.G. Desmedt","year":"1987","unstructured":"Desmedt, Y.G., Quisquater, J.-J.: Public-key systems based on the difficulty of tampering. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 111\u2013117. Springer, Heidelberg (1987)"},{"key":"18_CR8","unstructured":"Security requirements for cryptographic modules (FIPS PUB 140-1). Technical Report FIPS 140-1, National Institute of Standards and Technology, Gaithers- burg, MD (1994)"},{"key":"18_CR9","unstructured":"Secure Hash Standard (FIPS PUB 180-1). Technical Report FIPS 180-1, National Institute of Standards and Technology, Gaithersburg, MD (1995)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., Yung, M.: Witness Based Cryptographic ProgramChecking and Robust Function Sharing. In: Proceedings of the Twenty eighth Annual ACM Symposium on the Theory of Computing (STOC 96), pp. 499\u2013508 (1996)","DOI":"10.1145\/237814.237998"},{"issue":"2","key":"18_CR11","first-page":"99","volume":"3","author":"S. Haber","year":"1991","unstructured":"Haber, S., Stornetta, W.S.: How to Time-Stamp a Digital Document. Journal of Cryptography\u00a03(2), 99\u2013112 (1991)","journal-title":"Journal of Cryptography"},{"issue":"2","key":"18_CR12","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Rivest, R.: The MD5 Message Digest Algorithm. IETF RFC 1321 (April 1992)","DOI":"10.17487\/rfc1321"},{"key":"18_CR14","unstructured":"Yee, B.: Using Secure Coprocessors, Ph. D. thesis, Carnagie Mellon University, Computer Science Tech. Report CMU-CS-94-149 (May 1994)"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721064_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:39:57Z","timestamp":1556019597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721064_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679233","9783540445340"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10721064_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}