{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T22:27:29Z","timestamp":1690237649959},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T00:00:00Z","timestamp":1562630400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T00:00:00Z","timestamp":1562630400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00145-019-09329-9","type":"journal-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T14:24:30Z","timestamp":1562682270000},"page":"595-617","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Feasibility and Infeasibility of Secure Computation with Malicious PUFs"],"prefix":"10.1007","volume":"33","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[]},{"given":"Nils","family":"Fleischhacker","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,9]]},"reference":[{"key":"9329_CR1","doi-asserted-by":"crossref","unstructured":"F. Armknecht, R. Maes, A.-R. Sadeghi, F.-X. Standaert, C. Wachsmann, A formalization of the security features of physical functions, in IEEE Symposium on Security and Privacy (IEEE, Washington, 2011), pp. 397\u2013412","DOI":"10.1109\/SP.2011.10"},{"key":"9329_CR2","doi-asserted-by":"crossref","unstructured":"S. Badrinarayanan, D. Khurana, R. Ostrovsky, I. Visconti, Unconditional UC-secure computation with (stronger-malicious) PUFs, in Advances in Cryptology\u2014Eurocrypt \u00a02017, Part\u00a0I, Volume 10210 of LNCS (Springer, Berlin, 2017), pp. 382\u2013411","DOI":"10.1007\/978-3-319-56620-7_14"},{"issue":"3","key":"9329_CR3","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s00145-016-9233-9","volume":"30","author":"Boaz Barak","year":"2017","unstructured":"B. Barak, M. Mahmoody-Ghidary, Merkle puzzles are optimal\u2014an $$O(n^2)$$-query attack on any key exchange from a random oracle. J. Cryptol.30(3), 699\u2013734 (2017)","journal-title":"J. Cryptology"},{"key":"9329_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computations, in 20th Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, London, 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9329_CR5","doi-asserted-by":"crossref","unstructured":"C. Brzuska, M. Fischlin, H. Schr\u00f6der, S. Katzenbeisser, Physically uncloneable functions in the universal composition framework, in Advances in Cryptology\u2014Crypto 2011, Volume 6841 of LNCS (Springer, Berlin, 2011), pp. 51\u201370","DOI":"10.1007\/978-3-642-22792-9_4"},{"key":"9329_CR6","doi-asserted-by":"crossref","unstructured":"R. Canetti. Universally composable security: a new paradigm for cryptographic protocols, in 42nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, Washington, 2001), pp. 136\u2013145. Full version available at \nhttp:\/\/eprint.iacr.org\/2000\/067\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9329_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with global setup, in 4th Theory of Cryptography Conference\u2014TCC\u00a02007, Volume 4392 of LNCS (Springer, Berlin, 2007), pp. 61\u201385","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"9329_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in Advances in Cryptology\u2014Crypto\u00a02001, Volume 2139 of LNCS (Springer, Berlin, 2001), pp. 19\u201340","DOI":"10.1007\/3-540-44647-8_2"},{"issue":"2","key":"9329_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00145-005-0419-9","volume":"19","author":"Ran Canetti","year":"2006","unstructured":"R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptol.19(2), 135\u2013167 (2006)","journal-title":"J. Cryptology"},{"key":"9329_CR10","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, A. Scafuro, Unconditionally secure and universally composable commitments from physical assumptions, In Advances in Cryptology\u2014Asiacrypt\u00a02013, Part\u00a0II, Volume 8270 of LNCS (Springer, Berlin, 2013), pp. 100\u2013119","DOI":"10.1007\/978-3-642-42045-0_6"},{"issue":"1","key":"9329_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Yevgeniy Dodis","year":"2008","unstructured":"Y. Dodis, R. Ostrovsky, L. Reyzin, A. Smith, Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput.38(1), 97\u2013139 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"9329_CR12","doi-asserted-by":"crossref","unstructured":"V. Goyal, Y. Ishai, M. Mahmoody, A. Sahai, Interactive locking, zero-knowledge PCPs, and unconditional cryptography, in Advances in Cryptology\u2014Crypto\u00a02010, Volume 6223 of LNCS (Springer, Berlin, 2010), pp. 173\u2013190","DOI":"10.1007\/978-3-642-14623-7_10"},{"key":"9329_CR13","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations, in 21st Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 1989), pp. 44\u201361","DOI":"10.1145\/73007.73012"},{"key":"9329_CR14","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer\u2014efficiently, in Advances in Cryptology\u2014Crypto\u00a02008, Volume 5157 of LNCS (Springer, Berlin, 2008), pp. 572\u2013591","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9329_CR15","doi-asserted-by":"crossref","unstructured":"J. Katz, Universally composable multi-party computation using tamper-proof hardware, in Advances in Cryptology\u2014Eurocrypt\u00a02007, Volume 4515 of LNCS (Springer, Berlin, 2007), pp. 115\u2013128","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"9329_CR16","doi-asserted-by":"crossref","unstructured":"S. Katzenbeisser, \u00dc. Ko\u00e7abas, V. Rozic, A.-R. Sadeghi, I. Verbauwhede, C. Wachsmann, PUFs: Myth, fact or busted? A security evaluation of physically unclonable functions (PUFs) cast in silicon, in Cryptographic Hardware and Embedded Systems\u2014CHES\u00a02012, Volume 7428 of LNCS (Springer, Berlin, 2012), pp. 283\u2013301","DOI":"10.1007\/978-3-642-33027-8_17"},{"issue":"2","key":"9329_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Yehuda Lindell","year":"2009","unstructured":"Y. Lindell, B. Pinkas, A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol.22(2), 161\u2013188 (2009)","journal-title":"J. Cryptology"},{"key":"9329_CR18","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, A. Scafuro, I. Visconti, A. Wadia, Universally composable secure computation with (malicious) physically uncloneable functions, in Advances in Cryptology\u2014Eurocrypt\u00a02013, Volume 7881 of LNCS (Springer, Berlin, 2013), pp. 702\u2013718","DOI":"10.1007\/978-3-642-38348-9_41"},{"key":"9329_CR19","unstructured":"R.S. Pappu, Physical One-Way Functions. PhD thesis, Massachusetts Institute of Technology (2001)"},{"key":"9329_CR20","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"Ravikanth S Pappu","year":"2002","unstructured":"R.S. Pappu, B. Recht, J. Taylor, N. Gershenfeld, Physical one-way functions. Science297, 2026\u20132030 (2002)","journal-title":"Science"},{"key":"9329_CR21","doi-asserted-by":"crossref","unstructured":"U. R\u00fchrmair, Oblivious transfer based on physical uncloneable functions, in Trust and Trustworthy Computing, Volume 6101 of LNCS (Springer, Berlin, 2010), pp. 430\u2013440","DOI":"10.1007\/978-3-642-13869-0_31"},{"key":"9329_CR22","doi-asserted-by":"crossref","unstructured":"U. R\u00fchrmair, S. Katzenbeisser, H. Busch. Strong PUFs: models, constructions, and security proofs, in Towards Hardware-Intrinsic Security (Springer, Berlin, 2010), pp. 79\u201396","DOI":"10.1007\/978-3-642-14452-3_4"},{"key":"9329_CR23","doi-asserted-by":"crossref","unstructured":"U. R\u00fchrmair, M. van Dijk, PUFs in security protocols: attack models and security evaluations, in IEEE Symposium on Security and Privacy (IEEE, Washington, 2013), pp. 286\u2013300","DOI":"10.1109\/SP.2013.27"},{"key":"9329_CR24","unstructured":"M. van Dijk, U. R\u00fchrmair, Physical unclonable functions in cryptographic protocols: security proofs and impossibility results. Cryptology ePrint Archive, Report 2012\/228 (2012)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09329-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09329-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09329-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T23:08:20Z","timestamp":1594163300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09329-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,9]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9329"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09329-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,9]]},"assertion":[{"value":"15 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}