{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:25:03Z","timestamp":1778279103453,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030992767","type":"print"},{"value":"9783030992774","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-99277-4_6","type":"book-chapter","created":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T17:12:16Z","timestamp":1648314736000},"page":"111-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["How Do the\u00a0Arbiter PUFs Sample the\u00a0Boolean Function Class?"],"prefix":"10.1007","author":[{"given":"Animesh","family":"Roy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dibyendu","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhamoy","family":"Maitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,27]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-662-48324-4_27","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"GT Becker","year":"2015","unstructured":"Becker, G.T.: The gap between promise and reality: on the insecurity of XOR arbiter PUFs. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 535\u2013555. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_27"},{"key":"6_CR2","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"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9273-9","journal-title":"J. Cryptol."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Carlet, C., M\u00e9aux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Trans. Symmetric Cryptol. 3, 192\u2013227 (2017). (presented at FSE 2018)","DOI":"10.46586\/tosc.v2017.i3.192-227"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-662-44709-3_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"J Delvaux","year":"2014","unstructured":"Delvaux, J., Gu, D., Schellekens, D., Verbauwhede, I.: Secure lightweight entity authentication with strong PUFs: mission impossible? In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 451\u2013475. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_25"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-04138-9_5","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"S Devadas","year":"2009","unstructured":"Devadas, S.: Physical unclonable functions and secure processors. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, p. 65. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04138-9_5"},{"key":"6_CR7","unstructured":"Gassend, B.: Physical Random Functions. M.S. thesis, Department of Electrical Engineering Computer Science, Massachusetts Institute of Technology, Cambridge, January 2003. https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.13.7571&rep=rep1&type=pdf"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D., Dijk, M.V., Devadas, S.: Silicon physical random functions. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 148\u2013160. ACM (2002). https:\/\/dl.acm.org\/citation.cfm?id=586132","DOI":"10.1145\/586110.586132"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-68914-0_21","volume-title":"Applied Cryptography and Network Security","author":"G Hammouri","year":"2008","unstructured":"Hammouri, G., Sunar, B.: PUF-HB: a tamper-resilient HB based authentication protocol. In: Bellovin, S.M., Gennaro, R., Keromytis, A., Yung, M. (eds.) ACNS 2008. LNCS, vol. 5037, pp. 346\u2013365. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68914-0_21"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Lee, J.W., Lim, D., Gassend, B., Suh, G.E., Dijk, M.V., Devadas, S.: A technique to build a secret key in integrated circuits for identification and authentication applications. In: 2004 Symposium on VLSI Circuits. Digest of Technical Papers (IEEE Cat. No. 04CH37525), pp. 176\u2013179. IEEE (2004). https:\/\/people.csail.mit.edu\/devadas\/pubs\/vlsi-symp-puf.pdf","DOI":"10.1109\/VLSIC.2004.1346548"},{"key":"6_CR11","unstructured":"Lim, D.: Extracting Secret Keys from Integrated Circuits. M.Sc. thesis, MIT (2004)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Lim, D., Lee, J.W., Gassend, B., Suh, G.E., Dijk, M.V., Devadas, S.: Extracting secret keys from integrated circuits. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 13(10), 1200\u20131205 (2005)","DOI":"10.1109\/TVLSI.2005.859470"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-030-05378-9_16","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2018","author":"S Maitra","year":"2018","unstructured":"Maitra, S., Mandal, B., Martinsen, T., Roy, D., St\u0103nic\u0103, P.: Tools in analyzing linear approximation for Boolean functions related to FLIP. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 282\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_16"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1109\/TIT.2019.2932739","volume":"66","author":"S Maitra","year":"2020","unstructured":"Maitra, S., Mandal, B., Martinsen, T., Roy, D., St\u0103nic\u0103, P.: Analysis on Boolean function in a restricted (biased) domain. IEEE Trans. Inf. Theory 66(2), 1219\u20131231 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Majzoobi, M., Koushanfar, F., Potkonjak, M.: Testing techniques for hardware security. In International Test Conference (ITC), pp. 1\u201310. IEEE (2008)","DOI":"10.1109\/TEST.2008.4700636"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s12095-018-0293-6","volume":"11","author":"S Mesnager","year":"2019","unstructured":"Mesnager, S., Zhou, Z., Ding, C.: On the nonlinearity of Boolean functions with restricted input. Cryptogr. Commun. 11(1), 63\u201376 (2019)","journal-title":"Cryptogr. Commun."},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"R\u00fchrmair, U., Busch, H., Katzenbeisser, S.: Strong PUFs: models, constructions, and security proofs. In: Sadeghi, AR., Naccache, D. (eds.) Towards Hardware-Intrinsic Security. ISC, pp. 79\u201396. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14452-3_4","DOI":"10.1007\/978-3-642-14452-3_4"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"R\u00fchrmair, U., Devadas, S., Koushanfar, F.: Security based on physical unclonability and disorder. In: Tehranipoor, M., Wang, C. (eds.) Introduction to Hardware Security and Trust, pp. 65\u2013102. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4419-8080-9_4","DOI":"10.1007\/978-1-4419-8080-9_4"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair, U., Sehnke, F., S\u00f6lter, J., Dror, G., Devadas, S., Schmidhuber, J.: Modeling attacks on physical unclonable functions. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 237\u2013249. ACM (2010)","DOI":"10.1145\/1866307.1866335"},{"key":"6_CR21","unstructured":"R\u00fchrmair, U., S\u00f6lter, J., Sehnke, F.: On the Foundations of Physical Unclonable Functions. Cryptology ePrint Archive, p. 277 (2009). https:\/\/eprint.iacr.org\/2009\/277.pdf"},{"issue":"11","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1109\/TIFS.2013.2279798","volume":"8","author":"U R\u00fchrmair","year":"2013","unstructured":"R\u00fchrmair, U., et al.: PUF modeling attacks on simulated and silicon data. IEEE Trans. Inf. Forensics Secur. 8(11), 1876\u20131891 (2013)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"6_CR23","unstructured":"SageMath: A free open-source mathematics software. https:\/\/www.sagemath.org\/"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-35423-7_28","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"AA Siddhanti","year":"2019","unstructured":"Siddhanti, A.A., Bodapati, S., Chattopadhyay, A., Maitra, S., Roy, D., St\u0103nic\u0103, P.: Analysis of the strict avalanche criterion in variants of arbiter-based physically unclonable functions. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 556\u2013577. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_28"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99277-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T01:04:02Z","timestamp":1774487042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99277-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030992767","9783030992774"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99277-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sac2021.ca\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"23","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":"38% - 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":"6","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":"Papers authored by PC members underwent 5 reviews.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}