{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:55:58Z","timestamp":1725771358740},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642542411"},{"type":"electronic","value":"9783642542428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_28","type":"book-chapter","created":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T21:42:54Z","timestamp":1391377374000},"page":"663-687","source":"Crossref","is-referenced-by-count":5,"title":["Lower Bounds in the Hardware Token Model"],"prefix":"10.1007","author":[{"given":"Shashank","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhanjan","family":"Ananth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B. Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM\u00a059(2), 6:1\u20136:48 (2012)","journal-title":"J. ACM"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24638-1_14","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2004","unstructured":"Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 238\u2013257. Springer, Heidelberg (2004)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"issue":"6","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"Brassard, G., Crepeau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory\u00a042(6), 1769\u20131780 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539701392949","volume":"32","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM J. Comput.\u00a032(1), 1\u201347 (2002)","journal-title":"SIAM J. Comput."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New constructions for UC secure computation using tamper-proof hardware. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Discrete Math.\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, vol.\u00a02. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-540-78967-3_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"I. Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Wichs, D.: Isolated proofs of knowledge and isolated zero knowledge. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 509\u2013526. Springer, Heidelberg (2008)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-00457-5_19","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Wichs, D.: Universally composable multiparty computation with partially isolated parties. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 315\u2013331. Springer, Heidelberg (2009)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 42\u201355. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48910-X_4"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-19571-6_11","volume-title":"Theory of Cryptography","author":"N. D\u00f6ttling","year":"2011","unstructured":"D\u00f6ttling, N., Kraschewski, D., M\u00fcller-Quade, J.: Unconditional and composable security using a single stateful tamper-proof hardware token. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 164\u2013181. Springer, Heidelberg (2011)"},{"key":"28_CR13","unstructured":"D\u00f6ttling, N., Mie, T., M\u00fcller-Quade, J., Nilges, T.: Basing obfuscation on simple tamper-proof hardware assumptions. Technical Report 675 (2011)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-642-36594-2_36","volume-title":"Theory of Cryptography","author":"N. D\u00f6ttling","year":"2013","unstructured":"D\u00f6ttling, N., Mie, T., M\u00fcller-Quade, J., Nilges, T.: Implementing resettable UC-Functionalities with untrusted tamper-proof hardware-tokens. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 642\u2013661. Springer, Heidelberg (2013)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero knowledge, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"issue":"6","key":"28_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Feige, U., Killian, J., Naor, M.: A minimal model for secure computation. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 554\u2013563. ACM (1994)","DOI":"10.1145\/195058.195408"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 39\u201356. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Mahmoody, M., Sahai, A.: Interactive locking, zero-knowledge PCPs, and unconditional cryptography. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 173\u2013190. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14623-7_10"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-11799-2_19","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2010","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 308\u2013326. Springer, Heidelberg (2010)"},{"issue":"4","key":"28_CR23","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00145-006-0346-4","volume":"19","author":"D. Harnik","year":"2006","unstructured":"Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation: A computational view. J. Cryptology\u00a019(4), 521\u2013552 (2006)","journal-title":"J. Cryptology"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, 1997, pp. 174\u2013183. IEEE (1997)","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 294\u2013304. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45465-9_22","volume-title":"Automata, Languages and Programming","author":"Y. Ishai","year":"2002","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 261\u2013270. IEEE (2009)","DOI":"10.1109\/FOCS.2009.56"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Katz","year":"2007","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 115\u2013128. Springer, Heidelberg (2007)"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding crytpography on oblivious transfer. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11593447_8","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"V. Kolesnikov","year":"2005","unstructured":"Kolesnikov, V.: Gate evaluation secret sharing and secure one-round two-party computation. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 136\u2013155. Springer, Heidelberg (2005)"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation (2003)","DOI":"10.1007\/978-3-540-39819-6_4"},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24638-1_12","volume-title":"Theory of Cryptography","author":"Y. Lindell","year":"2004","unstructured":"Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 203\u2013222. Springer, Heidelberg (2004)"},{"key":"28_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-36594-2_17","volume-title":"Theory of Cryptography","author":"M. Mahmoody","year":"2013","unstructured":"Mahmoody, M., Xiao, D.: Languages with efficient zero-knowledge pcps are in szk. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 297\u2013314. Springer, Heidelberg (2013)"},{"key":"28_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-00457-5_16","volume-title":"Theory of Cryptography","author":"H.K. Maji","year":"2009","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation problems: The case of 2-party symmetric secure function evaluation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 256\u2013273. Springer, Heidelberg (2009)"},{"key":"28_CR36","doi-asserted-by":"crossref","unstructured":"Prabhakaran, V., Prabhakaran, M.: Assisted common information. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2602\u20132606 (2010)","DOI":"10.1109\/ISIT.2010.5513743"},{"key":"28_CR37","doi-asserted-by":"crossref","unstructured":"Prabhakaran, V., Prabhakaran, M.: Assisted common information: Further results. In: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2861\u20132865 (2011)","DOI":"10.1109\/ISIT.2011.6034098"},{"key":"28_CR38","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive, 2005:187 (2005)"},{"key":"28_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-642-14623-7_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"S. Winkler","year":"2010","unstructured":"Winkler, S., Wullschleger, J.: On the efficiency of classical and quantum oblivious transfer reductions. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 707\u2013723. Springer, Heidelberg (2010)"},{"issue":"6","key":"28_CR40","doi-asserted-by":"publisher","first-page":"2792","DOI":"10.1109\/TIT.2008.921674","volume":"54","author":"S. Wolf","year":"2008","unstructured":"Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional two-party computation. IEEE Transactions on Information Theory\u00a054(6), 2792\u20132797 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR41","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:40:05Z","timestamp":1565149205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}