{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:22:45Z","timestamp":1760710965609,"version":"3.41.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031069437"},{"type":"electronic","value":"9783031069444"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06944-4_26","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T19:51:47Z","timestamp":1653681107000},"page":"759-789","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unclonable Polymers and\u00a0Their Cryptographic Applications"],"prefix":"10.1007","author":[{"given":"Ghada","family":"Almashaqbeh","sequence":"first","affiliation":[]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[]},{"given":"Yaniv","family":"Erlich","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Gershoni","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]},{"given":"Itsik","family":"Pe\u2019er","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Roitburd-Berman","sequence":"additional","affiliation":[]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: 2009 24th Annual IEEE Conference on Computational Complexity, pp. 229\u2013242. IEEE (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021\u20131024 (1994)","DOI":"10.1126\/science.7973651"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1038\/scientificamerican0898-54","volume":"279","author":"LM Adleman","year":"1998","unstructured":"Adleman, L.M.: Computing with DNA. Sci. Am. 279(2), 54\u201361 (1998)","journal-title":"Sci. Am."},{"issue":"4","key":"26_CR4","first-page":"528","volume":"2021","author":"G Almashaqbeh","year":"2021","unstructured":"Almashaqbeh, G., et al.: Gage mpc: bypassing residual function leakage for non-interactive mpc. PETS 2021(4), 528\u2013548 (2021)","journal-title":"PETS"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-030-77886-6_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Ananth","year":"2021","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 501\u2013530. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_17"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Armknecht, F., Maes, R., Sadeghi, AR., Sunar, B., Tuyls, P.: Memory leakage-resilient encryption based on physically unclonable functions. In: Sadeghi, AR., Naccache, D. (eds.) Towards Hardware-Intrinsic Security. Information Security and Cryptography, pp. 135\u2013164. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14452-3_6","DOI":"10.1007\/978-3-642-14452-3_6"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-030-34621-8_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Jain, A., Ostrovsky, R., Visconti, I.: UC-secure multiparty computation from one-way functions using stateless tokens. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 577\u2013605. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_21"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1074\/mcp.R300012-MCP200","volume":"3","author":"MA Baldwin","year":"2004","unstructured":"Baldwin, M.A.: Protein identification by mass spectrometry issues to be considered. Mol. Cell. Proteom. 3(1), 1\u20139 (2004)","journal-title":"Mol. Cell. Proteom."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-34961-4_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Adaptively secure garbling with applications to one-time programs and secure outsourcing. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 134\u2013153. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_10"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-14623-7_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"N Bitansky","year":"2010","unstructured":"Bitansky, N., Canetti, R.: On strong simulation and composable point obfuscation. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 520\u2013537. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_28"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","volume":"80","author":"M Blawat","year":"2016","unstructured":"Blawat, M., et al.: Forward error correction for DNA data storage. Procedia Comput. Sci. 80, 1011\u20131022 (2016)","journal-title":"Procedia Comput. Sci."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-40084-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Broadbent","year":"2013","unstructured":"Broadbent, A., Gutoski, G., Stebila, D.: Quantum one-time programs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 344\u2013360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_20"},{"key":"26_CR14","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":"26_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020)","DOI":"10.1145\/3402457"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-540-78967-3_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Canetti","year":"2008","unstructured":"Canetti, R., Dakdouk, R.R.: Obfuscating point functions with multibit output. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 489\u2013508. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_28"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-11799-2_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2010","unstructured":"Canetti, R., Tauman Kalai, Y., Varia, M., Wichs, D.: On symmetric encryption and point obfuscation. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 52\u201371. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_4"},{"key":"26_CR18","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. 4965, pp. 545\u2013562. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_31"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Church, G.M., Gao, Y., Kosuri, S.: Next-generation digital information storage in DNA. Science, p. 1226355 (2012)","DOI":"10.1126\/science.1226355"},{"key":"26_CR20","unstructured":"Crick, F.H.: On protein synthesis. In: Symposia of the Society for Experimental Biology, vol. 12, p. 8 (1958)"},{"key":"26_CR21","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 \u2014 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. 1592, pp. 56\u201373. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_5"},{"key":"26_CR22","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":"26_CR23","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. 6597, pp. 164\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_11"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-19571-6_9","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2011","unstructured":"Dziembowski, S., Kazana, T., Wichs, D.: One-time computable self-erasing functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 125\u2013143. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_9"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Eichhorn, I., Koeberl, P., van der Leest, V.: Logically reconfigurable PUFs: memory-based secure key storage. In: Proceedings of the Sixth ACM Workshop on Scalable Trusted Computing, pp. 59\u201364 (2011)","DOI":"10.1145\/2046582.2046594"},{"key":"26_CR26","unstructured":"El Orche, F.E., et al.: Taphonomical security:(dna) information with foreseeable lifespan. Cryptology ePrint Archive (2021)"},{"issue":"6328","key":"26_CR27","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1126\/science.aaj2038","volume":"355","author":"Y Erlich","year":"2017","unstructured":"Erlich, Y., Zielinski, D.: DNA fountain enables a robust and efficient storage architecture. Science 355(6328), 950\u2013954 (2017)","journal-title":"Science"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-662-44381-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"B Fisch","year":"2014","unstructured":"Fisch, B., Freund, D., Naor, M.: Physical zero-knowledge proofs of physical properties. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 313\u2013336. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_18"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-662-46494-6_9","volume-title":"Theory of Cryptography","author":"BA Fisch","year":"2015","unstructured":"Fisch, B.A., Freund, D., Naor, M.: Secure physical computation using disposable circuits. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 182\u2013198. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_9"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_4"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS, pp. 40\u201349. IEEE (2013)","DOI":"10.1109\/FOCS.2013.13"},{"issue":"7506","key":"26_CR32","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1038\/nature13457","volume":"510","author":"A Glaser","year":"2014","unstructured":"Glaser, A., Barak, B., Goldston, R.J.: A zero-knowledge protocol for nuclear warhead verification. Nature 510(7506), 497\u2013502 (2014)","journal-title":"Nature"},{"issue":"2","key":"26_CR33","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1038\/nrd1011","volume":"2","author":"GL Glish","year":"2003","unstructured":"Glish, G.L., Vachet, R.W.: The basics of mass spectrometry in the twenty-first century. Nat. Rev. Drug Discov. 2(2), 140\u2013150 (2003)","journal-title":"Nat. Rev. Drug Discov."},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: ACM STOC (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-85174-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 39\u201356. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_3"},{"key":"26_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-70500-2_18","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Goyal, V.: Overcoming cryptographic impossibility results using blockchains. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 529\u2013561. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_18"},{"key":"26_CR37","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. 5978, pp. 308\u2013326. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_19"},{"issue":"8","key":"26_CR38","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1002\/anie.201411378","volume":"54","author":"RN Grass","year":"2015","unstructured":"Grass, R.N., Heckel, R., Puddu, M., Paunescu, D., Stark, W.J.: Robust chemical preservation of digital information on DNA in silica with error-correcting codes. Angew. Chem. Int. Ed. 54(8), 2552\u20132555 (2015)","journal-title":"Angew. Chem. Int. Ed."},{"key":"26_CR39","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Constructions of truly practical secure protocols using standardsmartcards. In: ACM CCS, pp. 491\u2013500 (2008)","DOI":"10.1145\/1455770.1455832"},{"key":"26_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-662-53641-4_15","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2016","unstructured":"Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Composable security in the tamper-proof hardware model under minimal complexity. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 367\u2013399. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_15"},{"key":"26_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-662-54388-7_15","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"C Hazay","year":"2017","unstructured":"Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Constant round adaptively secure protocols in the tamper-proof hardware model. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10175, pp. 428\u2013460. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_15"},{"key":"26_CR42","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: ACM STOC, pp. 60\u201373. ACM (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"26_CR43","unstructured":"Jin, C., Xu, X., Burleson, W.P., R\u00fchrmair, U., van Dijk, M.: Playpuf: programmable logically erasable PUFs for forward and backward secure key management. IACR Cryptol. ePrint Arch. 2015, 1052 (2015)"},{"key":"26_CR44","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. 4515, pp. 115\u2013128. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_7"},{"key":"26_CR45","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Anonymous authentication. J. Priv. Confid. 2(2) (2011)","DOI":"10.29012\/jpc.v2i2.590"},{"key":"26_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24676-3_2","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"B Lynn","year":"2004","unstructured":"Lynn, B., Prabhakaran, M., Sahai, A.: Positive results and techniques for obfuscation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 20\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_2"},{"key":"26_CR47","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error correcting codes, vol. 16. Elsevier (1977)"},{"issue":"10","key":"26_CR48","first-page":"1283","volume":"411","author":"T Moran","year":"2010","unstructured":"Moran, T., Naor, M.: Basing cryptographic protocols on tamper-evident seals. TCC 411(10), 1283\u20131310 (2010)","journal-title":"TCC"},{"key":"26_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-49162-7_14","volume-title":"Public Key Cryptography","author":"D Naccache","year":"1999","unstructured":"Naccache, D., Shamir, A., Stern, J.P.: How to copyright a function? In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 188\u2013196. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49162-7_14"},{"key":"26_CR50","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"},{"issue":"5589","key":"26_CR51","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"R Pappu","year":"2002","unstructured":"Pappu, R., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Science 297(5589), 2026\u20132030 (2002)","journal-title":"Science"},{"issue":"1","key":"26_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-07591-2","volume":"9","author":"MC Roehsner","year":"2018","unstructured":"Roehsner, M.C., Kettlewell, J.A., Batalh\u00e3o, T.B., Fitzsimons, J.F., Walther, P.: Quantum advantage for probabilistic one-time programs. Nat. Commun. 9(1), 1\u20138 (2018)","journal-title":"Nat. Commun."},{"key":"26_CR53","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair, U.: Oblivious transfer based on physical unclonable functions. In: International Conference on Trust and Trustworthy Computing, pp. 430\u2013440 (2010)","DOI":"10.1007\/978-3-642-13869-0_31"},{"key":"26_CR54","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: ACM STOC, pp. 523\u2013532 (2005)","DOI":"10.1145\/1060590.1060669"},{"key":"26_CR55","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"26_CR56","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Fu, L.H.B.: Research on DNA cryptography. In: Applied Cryptography and Network Security, vol. 357, pp. 10\u20135772. InTech, Rijeka, Croatia (2012)","DOI":"10.5772\/34510"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06944-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T22:03:25Z","timestamp":1748297005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06944-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069437","9783031069444"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06944-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"372","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Peer review was double-blind with rebuttal.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}