{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T22:41:09Z","timestamp":1761000069708,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819535361"},{"type":"electronic","value":"9789819535378"}],"license":[{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"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-3537-8_4","type":"book-chapter","created":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T10:44:03Z","timestamp":1760870643000},"page":"57-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ProverNG: Efficient Verification of\u00a0Compositional Masking for\u00a0Cryptosystem\u2019s Side-Channel Security"],"prefix":"10.1007","author":[{"given":"Yiming","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Limin","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,20]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-030-29959-0_15","volume-title":"Computer Security \u2013 ESORICS 2019","author":"G Barthe","year":"2019","unstructured":"Barthe, G., Bela\u00efd, S., Cassiers, G., Fouque, P.-A., Gr\u00e9goire, B., Standaert, F.-X.: maskVerif: automated verification of higher-order masking in presence of physical defaults. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 300\u2013318. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_15"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Barthe, G., et al.: Strong non-interference and type-directed higher-order masking. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 116\u2013129. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978427","DOI":"10.1145\/2976749.2978427"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bela\u00efd, S., Benhamouda, F., Passel\u00e8gue, A., Prouff, E., Thillard, A., Vergnaud, D.: Randomness complexity of private circuits for multiplication. In: EUROCRYPT 2016, pp. 616\u2013648. Springer, Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49896-5_22"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bela\u00efd, S., Mercadier, D., Rivain, M., Taleb, A.R.: IronMask: versatile verification of masking security. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, pp. 142\u2013160. IEEE (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833600","DOI":"10.1109\/SP46214.2022.9833600"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Bloem, R., Gro\u00df, H., Iusupov, R., K\u00f6nighofer, B., Mangard, S., Winter, J.: Formal verification of masked hardware implementations in the presence of glitches. In: EUROCRYPT 2018. LNCS, vol. 10821, pp. 321\u2013353. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_11","DOI":"10.1007\/978-3-319-78375-8_11"},{"issue":"8","key":"4_CR6","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1109\/TC.2020.3022979","volume":"70","author":"G Cassiers","year":"2021","unstructured":"Cassiers, G., Gr\u00e9goire, B., Levi, I., Standaert, F.: Hardware private circuits: from trivial composition to full verification. IEEE Trans. Comput. 70(10), 1677\u20131690 (2021). https:\/\/doi.org\/10.1109\/TC.2020.3022979","journal-title":"IEEE Trans. Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"2542","DOI":"10.1109\/TIFS.2020.2971153","volume":"15","author":"G Cassiers","year":"2020","unstructured":"Cassiers, G., Standaert, F.X.: Trivially and efficiently composing masked gadgets with probe isolating non-interference. IEEE Trans. Inf. Forensics Secur. 15, 2542\u20132555 (2020). https:\/\/doi.org\/10.1109\/TIFS.2020.2971153","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.: Provably secure hardware masking in the transition- and glitch-robust probing model: better safe than sorry. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2), 136\u2013158 (2021). https:\/\/doi.org\/10.46586\/TCHES.V2021.I2.136-158","DOI":"10.46586\/TCHES.V2021.I2.136-158"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: CRYPTO \u201999, 1999. LNCS, vol.\u00a01666, pp. 398\u2013412. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_26","DOI":"10.1007\/3-540-48405-1_26"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Coron, J., Prouff, E., Rivain, M., Roche, T.: Higher-order side channel security and mask refreshing. In: FSE 2013. LNCS, vol.\u00a08424, pp. 410\u2013424. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_21","DOI":"10.1007\/978-3-662-43933-3_21"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Dhooghe, S., Shahmirzadi, A.R., Moradi, A.: Second-order low-randomness d + 1 hardware sharing of the AES. In: CCS 2022, pp. 815\u2013828. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3560634","DOI":"10.1145\/3548606.3560634"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 423\u2013440. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_24","DOI":"10.1007\/978-3-642-55220-5_24"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Faust, S., Grosso, V., Pozo, S.M.D., Paglialonga, C., Standaert, F.: Composable masking schemes in the presence of physical defaults & the robust probing model. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3), 89\u2013120 (2018). https:\/\/doi.org\/10.13154\/TCHES.V2018.I3.89-120","DOI":"10.13154\/TCHES.V2018.I3.89-120"},{"key":"4_CR15","unstructured":"Gigerl, B., Hadzic, V., Primas, R., Mangard, S., Bloem, R.: Coco: co-design and co-verification of masked software implementations on CPUs. In: USENIX Security 2021, pp. 1469\u20131468. USENIX Association (2021)"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Hadzic, V., Bloem, R.: Efficient and composable masked AES s-box designs using optimized inverters. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(1), 656\u2013683 (2025). https:\/\/doi.org\/10.46586\/TCHES.V2025.I1.656-683","DOI":"10.46586\/TCHES.V2025.I1.656-683"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: CRYPTO 2003, pp. 463\u2013481. Springer, Berlin, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Knichel, D., Moradi, A.: Low-latency hardware private circuits. In: CCS 2022, pp. 1799\u20131812. CCS \u201922, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3559362","DOI":"10.1145\/3548606.3559362"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Knichel, D., Sasdrich, P., Moradi, A.: Silver\u2013statistical independence and leakage verification. In: Advances in Cryptology \u2013 ASIACRYPT 2020, pp. 787\u2013816. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-64837-4_26"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Liu, J., et al.: Small tweaks do not help: differential power analysis of MILENAGE implementations in 3g\/4g USIM cards. In: ESORICS 2015. LNCS, vol.\u00a09326, pp. 468\u2013480. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_24","DOI":"10.1007\/978-3-319-24174-6_24"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Mangard, S., Pramstaller, N., Oswald, E.: Successfully attacking masked AES hardware implementations. In: CHES 2005. LNCS, vol.\u00a03659, pp. 157\u2013171. Springer (2005). https:\/\/doi.org\/10.1007\/11545262_12","DOI":"10.1007\/11545262_12"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Moos, T., Moradi, A., Schneider, T., Standaert, F.: Glitch-resistant masking revisited or why proofs in the robust probing model are needed. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(2), 256\u2013292 (2019). https:\/\/doi.org\/10.13154\/TCHES.V2019.I2.256-292","DOI":"10.13154\/TCHES.V2019.I2.256-292"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Shahmirzadi, A.R., Moradi, A.: Re-consolidating first-order masking schemes nullifying fresh randomness. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 305\u2013342 (2021). https:\/\/doi.org\/10.46586\/TCHES.V2021.I1.305-342","DOI":"10.46586\/TCHES.V2021.I1.305-342"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Zhou, F., Chen, H., Fan, L.: Prover - toward more efficient formal verification of masking in probing model. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(1), 552\u2013585 (2025). https:\/\/doi.org\/10.46586\/TCHES.V2025.I1.552-585","DOI":"10.46586\/TCHES.V2025.I1.552-585"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3537-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T22:03:03Z","timestamp":1760997783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3537-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,20]]},"ISBN":["9789819535361","9789819535378"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3537-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,20]]},"assertion":[{"value":"20 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"29 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}