{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:39:21Z","timestamp":1767137961991,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486203","type":"print"},{"value":"9783031486210","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48621-0_5","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"123-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiently Testable Circuits Without Conductivity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3650-7893","authenticated-orcid":false,"given":"Mirza Ahad","family":"Baig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5352-4946","authenticated-orcid":false,"given":"Suvradip","family":"Chakraborty","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6914-6425","authenticated-orcid":false,"given":"Stefan","family":"Dziembowski","sequence":"additional","affiliation":[]},{"given":"Ma\u0142gorzata","family":"Ga\u0142\u0105zka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8563-4325","authenticated-orcid":false,"given":"Tomasz","family":"Lizurej","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Shmoys, D.B. (ed.), Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2013June 03, 2014, pp. 774\u2013783. ACM (2014). https:\/\/doi.org\/10.1145\/2591796.2591804","DOI":"10.1145\/2591796.2591804"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-01446-9_5","volume-title":"Provable Security","author":"G Ateniese","year":"2018","unstructured":"Ateniese, G., Kiayias, A., Magri, B., Tselekounis, Y., Venturi, D.: Secure outsourcing of cryptographic circuits manufacturing. In: Baek, J., Susilo, W., Kim, J. (eds.) ProvSec 2018. LNCS, vol. 11192, pp. 75\u201393. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01446-9_5"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Baig, M.A., Chakraborty, S., Dziembowski, S., Ga\u0142czka, M., Lizurej, T., Pietrzak, K.: Efficiently testable circuits. In: ITCS - Innovations in Theoretical Computer Science (2023)","DOI":"10.1007\/978-3-031-48621-0_5"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, and Li-Yang Tan. Non-malleable codes for small-depth circuits. In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018, pages 826\u2013837. IEEE Computer Society, 2018. https:\/\/doi.org\/10.1109\/FOCS.2018.00083","DOI":"10.1109\/FOCS.2018.00083"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-92075-3_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"F Berti","year":"2021","unstructured":"Berti, F., Guo, C., Peters, T., Standaert, F.-X.: Efficient leakage-resilient MACs without idealized assumptions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 95\u2013123. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_4"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Bhunia, S., Tehranipoor, M.: The Hardware Trojan War. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-68511-3","DOI":"10.1007\/978-3-319-68511-3"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0052259","volume-title":"Advances in Cryptology \u2014 CRYPTO 1997","author":"E Biham","year":"1997","unstructured":"Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 513\u2013525. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052259"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D Boneh","year":"2001","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of eliminating errors in cryptographic computations. J. Cryptol. 14(2), 101\u2013119 (2001)","journal-title":"J. Cryptol."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00145-012-9136-3","volume":"26","author":"E Boyle","year":"2012","unstructured":"Boyle, E., Segev, G., Wichs, D.: Fully Leakage-Resilient Signatures. J. Cryptol. 26(3), 513\u2013558 (2012). https:\/\/doi.org\/10.1007\/s00145-012-9136-3","journal-title":"J. Cryptol."},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Bushnell, M., Agrawal, V.: Essentials of Electronic Testing for Digital, Memory and Mixed-signal VLSI Circuits, vol. 17. Springer Science & Business Media, Cham (2004). https:\/\/doi.org\/10.1007\/b117406","DOI":"10.1007\/b117406"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-030-90453-1_14","volume-title":"Theory of Cryptography","author":"S Chakraborty","year":"2021","unstructured":"Chakraborty, S., Dziembowski, S., Ga\u0142\u0105zka, M., Lizurej, T., Pietrzak, K., Yeo, M.: Trojan-resilience without cryptography. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 397\u2013428. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_14"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Li, X.: Non-malleable codes and extractors for small-depth circuits, and affine functions. In: Hatami, H., McKenzie, P., King, V., (eds.), Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017, pp. 1171\u20131184. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055483","DOI":"10.1145\/3055399.3055483"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-32009-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"D Dachman-Soled","year":"2012","unstructured":"Dachman-Soled, D., Kalai, Y.T.: Securing circuits against constant-rate tampering. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 533\u2013551. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_31"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-54242-8_23","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2014","unstructured":"Dachman-Soled, D., Kalai, Y.T.: Securing circuits and protocols against 1\/poly(k) tampering rate. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 540\u2013565. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_23"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00145-018-9306-z","volume":"33","author":"D Dachman-Soled","year":"2018","unstructured":"Dachman-Soled, D., Liu, F.-H., Shi, E., Zhou, H.-S.: Locally decodable and updatable non-malleable codes and their applications. J. Cryptol. 33(1), 319\u2013355 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9306-z","journal-title":"J. Cryptol."},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Faust, S., Standaert, F.-X.: Private circuits III: hardware trojan-resilience via testing amplification. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S., (eds.), ACM CCS, pp. 142\u2013153. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978419","DOI":"10.1145\/2976749.2978419"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25\u201328, 2008, Philadelphia, PA, USA, pp. 293\u2013302. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.56","DOI":"10.1109\/FOCS.2008.56"},{"issue":"4","key":"5_CR18","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/3178432","volume":"65","author":"S Dziembowski","year":"2018","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4), 20:1-20:32 (2018). https:\/\/doi.org\/10.1145\/3178432","journal-title":"J. ACM"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Efremenko, K., et al.: Circuits resilient to short-circuit errors. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pp. 582\u2013594. Association for Computing Machinery, New York, NY, USA (2022). ISBN 9781450392648. https:\/\/doi.org\/10.1145\/3519935.3520007","DOI":"10.1145\/3519935.3520007"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-11799-2_21","volume-title":"Theory of Cryptography","author":"S Faust","year":"2010","unstructured":"Faust, S., Kiltz, E., Pietrzak, K., Rothblum, G.N.: Leakage-resilient signatures. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 343\u2013360. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_21"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-46447-2_26","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"S Faust","year":"2015","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: A tamper and leakage resilient von Neumann architecture. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 579\u2013603. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_26"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Faust, S., Pietrzak, K., Venturi, D.: Tamper-proof circuits: how to trade leakage for tamper-resilience, pp. 391\u2013402 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_33","DOI":"10.1007\/978-3-642-22006-7_33"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M.M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 495\u2013504. Association for Computing Machinery, New York, NY, USA (2014). ISBN 9781450327107. https:\/\/doi.org\/10.1145\/2591796.2591861","DOI":"10.1145\/2591796.2591861"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11761679_19","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"Y Ishai","year":"2006","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A., Wagner, D.: Private circuits II: keeping secrets in tamperable circuits. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 308\u2013327. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_19"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Lewko, A.B., Rao, A.: Formulas resilient to short-circuit errors. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20\u201323, 2012, pp. 490\u2013499. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.69","DOI":"10.1109\/FOCS.2012.69"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Reyzin, L.: A survey of leakage-resilient cryptography. In: Goldreich, O., (ed.) Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 727\u2013794. ACM (2019). https:\/\/doi.org\/10.1145\/3335741.3335768","DOI":"10.1145\/3335741.3335768"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-42045-0_9","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"A Kiayias","year":"2013","unstructured":"Kiayias, A., Tselekounis, Y.: Tamper resilient circuits: the adversary at the gates. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 161\u2013180. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_9"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Hatami, H., McKenzie, P., King, V. (eds.), Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017, pp. 1144\u20131156. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055486","DOI":"10.1145\/3055399.3055486"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278\u2013296. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_16"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Wahby, R.S. Howald, M., Garg, S., Shelat, A., Walfish, M., Verifiable Asics. In: IEEE SP, pp. 759\u2013778. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/SP.2016.51","DOI":"10.1109\/SP.2016.51"}],"updated-by":[{"DOI":"10.1007\/978-3-031-48621-0_18","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000}}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48621-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:01Z","timestamp":1764118981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48621-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486203","9783031486210"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48621-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"27 November 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}