{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:29Z","timestamp":1772240669331,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819529605","type":"print"},{"value":"9789819529612","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-2961-2_16","type":"book-chapter","created":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:02:11Z","timestamp":1760364131000},"page":"299-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Attack to\u00a0Universally Composable Commitments from\u00a0Malicious Physically Uncloneable Functions and\u00a0How to\u00a0Avoid\u00a0It"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5073-3479","authenticated-orcid":false,"given":"Louren\u00e7o","family":"Abecasis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2393-8224","authenticated-orcid":false,"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4277-4800","authenticated-orcid":false,"given":"Chrysoula","family":"Vlachou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13, 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 494\u2013503 (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"16_CR5","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 \u2014 EUROCRYPT 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. 2656, pp. 68\u201386. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_5"},{"key":"16_CR6","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. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"Canetti, R.: Universally composable security. J. ACM 67, 1\u201394 (2020). https:\/\/doi.org\/10.1145\/3402457","journal-title":"J. ACM"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Pappu, R., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Science 297, 2026\u20132030 (2002). https:\/\/www.science.org\/doi\/abs\/10.1126\/science.1074376","DOI":"10.1126\/science.1074376"},{"key":"16_CR10","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. 6841, pp. 51\u201370. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_4"},{"key":"16_CR11","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. 7881, pp. 702\u2013718. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_41"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-42045-0_6","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Scafuro, A.: Unconditionally secure and universally composable commitments from physical assumptions. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 100\u2013119. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_6"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-662-44381-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Dachman-Soled","year":"2014","unstructured":"Dachman-Soled, D., Fleischhacker, N., Katz, J., Lysyanskaya, A., Schr\u00f6der, D.: Feasibility and infeasibility of secure computation with malicious PUFs. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 405\u2013420. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_23"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-319-56620-7_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Badrinarayanan","year":"2017","unstructured":"Badrinarayanan, S., Khurana, D., Ostrovsky, R., Visconti, I.: Unconditional UC-secure computation with (stronger-malicious) PUFs. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 382\u2013411. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_14"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00145-022-09432-4","volume":"35","author":"B Magri","year":"2022","unstructured":"Magri, B., Malavolta, G., Schr\u00f6der, D., Unruh, D.: Everlasting UC commitments from fully malicious PUFs. J. Cryptol. 35, 20 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09432-4","journal-title":"J. Cryptol."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Maes, R.: Physically Unclonable Functions: Constructions, Properties and Applications. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41395-7","DOI":"10.1007\/978-3-642-41395-7"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4, 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_31"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Abecasis, L., Mateus, P., Vlachou, C.: An attack to universally composable commitments from malicious physically uncloneable functions and how to avoid it. Cryptology ePrint Archive, Paper 2025\/1374 (2025). https:\/\/eprint.iacr.org\/2025\/1374","DOI":"10.1007\/978-981-95-2961-2_16"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-2961-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:47:49Z","timestamp":1772196469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-2961-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"ISBN":["9789819529605","9789819529612"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-2961-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"10 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yokohama","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sulab-sever.u-aizu.ac.jp\/provsec2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}