{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:05Z","timestamp":1772240645199,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642420443","type":"print"},{"value":"9783642420450","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42045-0_6","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T08:53:33Z","timestamp":1385196813000},"page":"100-119","source":"Crossref","is-referenced-by-count":25,"title":["Unconditionally Secure and Universally Composable Commitments from Physical Assumptions"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Scafuro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Maes, R., Sadeghi, A.R., Standaert, F.X., Wachsmann, C.: A formalization of the security features of physical functions. In: IEEE Symposium on Security and Privacy, pp. 397\u2013412. IEEE Computer Society (2011)","DOI":"10.1109\/SP.2011.10"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-642-10366-7_40","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"F. Armknecht","year":"2009","unstructured":"Armknecht, F., Maes, R., Sadeghi, A.R., Sunar, B., Tuyls, P.: Memory leakage-resilient encryption based on physically unclonable functions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 685\u2013702. Springer, Heidelberg (2009)"},{"key":"6_CR3","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: Foundations of Computer Science (FOCS 2004), pp. 394\u2013403 (2004)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Boit, C., Helfmeier, C., Nedospasaov, D., Seifert, J.P.: Cloning physically unclonable functions. In: IEEE HOST (2013)","DOI":"10.1109\/HST.2013.6581556"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-22792-9_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"C. Brzuska","year":"2011","unstructured":"Brzuska, C., Fischlin, M., Schr\u00f6der, H., Katzenbeisser, S.: Physically uncloneable functions in the universal composition framework. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 51\u201370. Springer, Heidelberg (2011)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Brzuska, C., Fischlin, M., Schr\u00f6der, H., Katzenbeisser, S.: Physically uncloneable functions in the universal composition framework. IACR Cryptology ePrint Archive 2011, 681 (2011)","DOI":"10.1007\/978-3-642-22792-9_4"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Foundations of Computer Science (FOCS 2001), pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39200-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 68\u201386. Springer, Heidelberg (2003)"},{"key":"6_CR12","first-page":"494","volume-title":"34th Annual ACM Symposium on Theory of Computing","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, May 19-21, pp. 494\u2013503. ACM Press, Montr\u00e9al (2002)"},{"key":"6_CR13","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.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC. pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"6_CR15","unstructured":"Choi, S.G., Katz, J., Schr\u00f6der, D., Yerukhimovich, A., Zhou, H.S.: (efficient) universally composable two-party computation using a minimal number of stateless tokens. IACR Cryptology ePrint Archive 2011, 689 (2011)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: FOCS, pp. 42\u201352. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"I. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I., Kilian, J., Salvail, L.: On the (Im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 56\u201373. Springer, Heidelberg (1999)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Scafuro, A.: Unconditionally secure and universally composable commitments from physical assumptions. IACR Cryptology ePrint Archive 2013, 108 (2013)","DOI":"10.1007\/978-3-642-42045-0_6"},{"key":"6_CR19","unstructured":"van Dijk, M., R\u00fchrmair, U.: Physical unclonable functions in cryptographic protocols: Security proofs and impossibility results. IACR Cryptology ePrint Archive 2012, 228 (2012)"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput.\u00a038(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"6_CR21","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":"6_CR22","unstructured":"D\u00f6ttling, N., Kraschewski, D., M\u00fcller-Quade, J.: David & goliath oblivious affine function evaluation - asymptotically optimal building blocks for universally composable two-party computation from a single untrusted stateful tamper-proof hardware token. IACR Cryptology ePrint Archive 2012, 135 (2012)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-14623-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"V. Goyal","year":"2010","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)"},{"key":"6_CR24","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":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s00145-010-9066-x","volume":"24","author":"D. Hofheinz","year":"2011","unstructured":"Hofheinz, D.: Possibility and impossibility results for selective decommitments. J. Cryptology\u00a024(3), 470\u2013516 (2011)","journal-title":"J. Cryptology"},{"key":"6_CR26","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":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-33027-8_17","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"S. Katzenbeisser","year":"2012","unstructured":"Katzenbeisser, S., Kocabas\u0328, \u00dc., Ro\u017ei\u0107, V., Sadeghi, A.-R., Verbauwhede, I., Wachsmann, C.: PUFs: Myth, fact or busted? A security evaluation of physically unclonable functions (PUFs) cast in silicon. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol.\u00a07428, pp. 283\u2013301. Springer, Heidelberg (2012)"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/129712.129782","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992","author":"J. Kilian","year":"1992","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 723\u2013732. ACM, New York (1992), http:\/\/doi.acm.org\/10.1145\/129712.129782"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-11799-2_20","volume-title":"Theory of Cryptography","author":"V. Kolesnikov","year":"2010","unstructured":"Kolesnikov, V.: Truly efficient string oblivious transfer using resettable tamper-proof tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 327\u2013342. Springer, Heidelberg (2010)"},{"key":"6_CR30","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-14452-3_1","volume-title":"Towards Hardware-Intrinsic Security","author":"R. Maes","year":"2010","unstructured":"Maes, R., Verbauwhede, I.: Physically unclonable functions: A study on the state of the art and future research directions. In: Sadeghi, A.R., Naccache, D. (eds.) Towards Hardware-Intrinsic Security. Information Security and Cryptography, pp. 3\u201337. Springer, Heidelberg (2010)"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-78967-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"T. Moran","year":"2008","unstructured":"Moran, T., Segev, G.: David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 527\u2013544. Springer, Heidelberg (2008)"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-70936-7_3","volume-title":"Theory of Cryptography","author":"J. M\u00fcller-Quade","year":"2007","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 41\u201360. Springer, Heidelberg (2007)"},{"issue":"4","key":"6_CR33","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s00145-010-9068-8","volume":"23","author":"J. M\u00fcller-Quade","year":"2010","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability. J. Cryptology\u00a023(4), 594\u2013671 (2010)","journal-title":"J. Cryptology"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Naor","year":"1990","unstructured":"Naor, M.: Bit commitment using pseudo-randomness. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 128\u2013136. Springer, Heidelberg (1990)"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Scafuro, A., Visconti, I., Wadia, A.: Universally composable secure computation with (malicious) physically uncloneable functions. IACR Cryptology ePrint Archive 2012, 143 (2012)","DOI":"10.1007\/978-3-642-38348-9_41"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-642-38348-9_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R. Ostrovsky","year":"2013","unstructured":"Ostrovsky, R., Scafuro, A., Visconti, I., Wadia, A.: Universally composable secure computation with (malicious) physically uncloneable functions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 702\u2013718. Springer, Heidelberg (2013)"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"R.S. Pappu","year":"2002","unstructured":"Pappu, R.S., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Science\u00a0297, 2026\u20132030 (2002)","journal-title":"Science"},{"key":"6_CR38","unstructured":"Pappu, R.S.: Physical One-Way Functions. Ph.D. thesis, MIT (2001)"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 403\u2013418. Springer, Heidelberg (2009)"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-642-13869-0_31","volume-title":"Trust and Trustworthy Computing","author":"U. R\u00fchrmair","year":"2010","unstructured":"R\u00fchrmair, U.: Oblivious transfer based on physical unclonable functions. In: Acquisti, A., Smith, S.W., Sadeghi, A.R. (eds.) TRUST 2010. LNCS, vol.\u00a06101, pp. 430\u2013440. Springer, Heidelberg (2010)"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair, U., van Dijk, M.: Pufs in security protocols: Attack models and security evaluations. In: IEEE Symposium on Security and Privacy (2013)","DOI":"10.1109\/SP.2013.27"},{"key":"6_CR42","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-14452-3_13","volume-title":"Towards Hardware-Intrinsic Security","author":"A.R. Sadeghi","year":"2010","unstructured":"Sadeghi, A.R., Visconti, I., Wachsmann, C.: Enhancing rfid security and privacy by physically unclonable functions. In: Sadeghi, A.R., Naccache, D. (eds.) Towards Hardware-Intrinsic Security. Information Security and Cryptography, pp. 281\u2013305. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42045-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T06:37:15Z","timestamp":1647499035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42045-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420443","9783642420450"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42045-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}