{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T06:18:43Z","timestamp":1772777923356,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030757618","type":"print"},{"value":"9783030757625","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-75762-5_15","type":"book-chapter","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T09:07:43Z","timestamp":1620464863000},"page":"176-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Attack Is the Best Defense: A Multi-Mode Poisoning PUF Against Machine Learning Attacks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7400-5694","authenticated-orcid":false,"given":"Chia-Chih","family":"Lin","sequence":"first","affiliation":[]},{"given":"Ming-Syan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Awano, H., Sato, T.: Ising-PUF: a machine learning attack resistant PUF featuring lattice like arrangement of arbiter-PUFs. In: Proceedings of DATE, pp. 1447\u20131452 (2018)","DOI":"10.23919\/DATE.2018.8342239"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Babaei, A., Schiele, G.: Physical unclonable functions in the internet of things: state of the art and open challenges. Sensors 19, 3208 (2019)","DOI":"10.3390\/s19143208"},{"key":"15_CR3","unstructured":"Biggio, B., Nelson, B., Laskov, P.: Poisoning attacks against support vector machines. In: Proceedings of ICML, pp. 1467\u20131474 (2012)"},{"key":"15_CR4","unstructured":"Chollet, F., et al.: Keras (2015). https:\/\/keras.io"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D., van Dijk, M., Devadas, S.: Controlled physical random functions. In: Proceedings of ACSAC, pp. 149\u2013160 (2002)","DOI":"10.1145\/586110.586132"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Kearns, M., Li, M.: Learning in the presence of malicious errors. In: Proceedings of STOC, pp. 267\u2013280 (1988)","DOI":"10.1145\/62212.62238"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Khalafalla, M., Gebotys, C.: PUFs deep attacks: enhanced modeling attacks using deep learning techniques to break the security of double arbiter PUFs. In: Proceedings of DATE, pp. 204\u2013209 (2019)","DOI":"10.23919\/DATE.2019.8714862"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Ma, Q., Gu, C., Hanley, N., Wang, C., Liu, W., O\u2019Neill, M.: A machine learning attack resistant multi-PUF design on FPGA. In: Proceedings of ASP-DAC, pp. 97\u2013104 (2018)","DOI":"10.1109\/ASPDAC.2018.8297289"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Machida, T., Yamamoto, D., Iwamoto, M., Sakiyama, K.: A new arbiter PUF for enhancing unpredictability on FPGA. Sci. World J. 2015 (2015)","DOI":"10.1155\/2015\/864812"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Majzoobi, M., Koushanfar, F., Potkonjak, M.: Lightweight secure PUFs. In: Proceedings of IEEE\/ACM ICCAD, pp. 670\u2013673 (2008)","DOI":"10.1109\/ICCAD.2008.4681648"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Mispan, M.S., Su, H., Zwolinski, M., Halak, B.: Cost-efficient design for modeling attacks resistant PUFs. In: Proceedings of DATE, pp. 467\u2013472 (2018)","DOI":"10.23919\/DATE.2018.8342054"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, P.H., Sahoo, D.P., Chakraborty, R.S., Mukhopadhyay, D.: Security analysis of arbiter PUF and its lightweight compositions under predictability test. ACM TODAES 22(2), December 2016","DOI":"10.1145\/2940326"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, P.H., Sahoo, D.P., Jin, C., Mahmood, K., Ruhrmair, U., van Dijk,M.: The interpose PUF: secure PUF design against state-of-the-art machine learning attacks. In: TCHES, vol. 2019, no. 4, pp. 243\u2013290, August 2019","DOI":"10.46586\/tches.v2019.i4.243-290"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair, U., et al.: PUF modeling attacks on simulated and silicon data. IEEE TIFS 8(11), 1876\u20131891 (2013)","DOI":"10.1109\/TIFS.2013.2279798"},{"key":"15_CR15","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 CCS, pp. 237\u2013249. ACM (2010)","DOI":"10.1145\/1866307.1866335"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Sahoo, D.P., Mukhopadhyay, D., Chakraborty, R.S., Nguyen, P.H.: A multiplexer-based arbiter PUF composition with enhanced reliability and security. IEEE TC 67(3), 403\u2013417 (2018)","DOI":"10.1109\/TC.2017.2749226"},{"key":"15_CR17","unstructured":"Santikellur, P., Bhattacharyay, A., Chakraborty, R.S.: Deep learning based model building attacks on arbiter PUF compositions. IACR Cryptol. ePrint Arch. 2019, 566 (2019)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Q., Gao, M., Qu, G.: A machine learning attack resistant dual-mode PUF. In: Proceedings of ACM GLSVLSI, pp. 177\u2013182 (2018)","DOI":"10.1145\/3194554.3194590"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Wang, S., Chen, Y., Li, K.S.: Adversarial attack against modeling attack on PUFs. In: Proceedings of ACM\/IEEE DAC, pp. 1\u20136 (2019)","DOI":"10.1145\/3316781.3317761"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Zalivaka, S.S., Ivaniuk, A.A., Chang, C.: Low-cost fortification of arbiter PUF against modeling attack. In: Proceedings of IEEE ISCAS, pp. 1\u20134 (2017)","DOI":"10.1109\/ISCAS.2017.8050671"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75762-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:13:40Z","timestamp":1710350020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75762-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757618","9783030757625"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75762-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","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":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","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":"157","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":"7","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)"}}]}}