{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T21:02:49Z","timestamp":1790802169429,"version":"4.1.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T00:00:00Z","timestamp":1563408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["CNS-1617203"],"award-info":[{"award-number":["CNS-1617203"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61532019 and 61761136011"],"award-info":[{"award-number":["61532019 and 61761136011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2019,7,31]]},"abstract":"<jats:p>\n            Power side-channel attacks, capable of deducing secret data using statistical analysis, have become a serious threat. Random masking is a widely used countermeasure for removing the statistical dependence between secret data and side-channel information. Although there are techniques for verifying whether a piece of software code is perfectly masked, they are limited in accuracy and scalability. To bridge this gap, we propose a refinement-based method for verifying masking countermeasures. Our method is more accurate than prior type-inference-based approaches and more scalable than prior model-counting-based approaches using SAT or SMT solvers. Indeed, our method can be viewed as a gradual refinement of a set of type-inference rules for reasoning about distribution types. These rules are kept\n            <jats:italic>abstract<\/jats:italic>\n            initially to allow fast deduction and then made\n            <jats:italic>concrete<\/jats:italic>\n            when the abstract version is not able to resolve the verification problem. We also propose algorithms for quantifying the amount of side-channel information leakage from a software implementation using the notion of quantitative masking strength. We have implemented our method in a software tool and evaluated it on cryptographic benchmarks including AES and MAC-Keccak. The experimental results show that our method significantly outperforms state-of-the-art techniques in terms of accuracy and scalability.\n          <\/jats:p>","DOI":"10.1145\/3330392","type":"journal-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:14Z","timestamp":1563542234000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Verifying and Quantifying Side-channel Resistance of Masked Software Implementations"],"prefix":"10.1145","volume":"28","author":[{"given":"Pengfei","family":"Gao","sequence":"first","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fu","family":"Song","sequence":"additional","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228376"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the USENIX Security Symposium. 53--70","author":"Almeida Jos\u00e9 Bacelar","year":"2016","unstructured":"Jos\u00e9 Bacelar Almeida , Manuel Barbosa , Gilles Barthe , Fran\u00e7ois Dupressoir , and Michael Emmi . 2016 . Verifying constant-time implementations . In Proceedings of the USENIX Security Symposium. 53--70 . Jos\u00e9 Bacelar Almeida, Manuel Barbosa, Gilles Barthe, Fran\u00e7ois Dupressoir, and Michael Emmi. 2016. Verifying constant-time implementations. In Proceedings of the USENIX Security Symposium. 53--70."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062378"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the IACR Cryptology ePrint Archive","author":"Arribas Victor","year":"2017","unstructured":"Victor Arribas , Svetla Nikova , and Vincent Rijmen . 2017 . VerMI: Verification tool for masked implementations . In Proceedings of the IACR Cryptology ePrint Archive (2017), 1227. Victor Arribas, Svetla Nikova, and Vincent Rijmen. 2017. VerMI: Verification tool for masked implementations. In Proceedings of the IACR Cryptology ePrint Archive (2017), 1227."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the International Conference on Smart Card Research and Advanced Applications (CARDIS\u201914)","author":"Balasch Josep","year":"2014","unstructured":"Josep Balasch , Benedikt Gierlichs , Vincent Grosso , Oscar Reparaz , and Fran\u00e7ois-Xavier Standaert . 2014 . On the cost of lazy engineering for masked software implementations . In Proceedings of the International Conference on Smart Card Research and Advanced Applications (CARDIS\u201914) . 64--81. Josep Balasch, Benedikt Gierlichs, Vincent Grosso, Oscar Reparaz, and Fran\u00e7ois-Xavier Standaert. 2014. On the cost of lazy engineering for masked software implementations. In Proceedings of the International Conference on Smart Card Research and Advanced Applications (CARDIS\u201914). 64--81."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950362"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_18"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978427"},{"key":"e_1_2_1_10_1","first-page":"562","article-title":"maskVerif: A formal tool for analyzing software and hardware masked implementations","volume":"2018","author":"Barthe Gilles","year":"2018","unstructured":"Gilles Barthe , Sonia Bela\u00efd , Pierre-Alain Fouque , and Benjamin Gr\u00e9goire . 2018 . maskVerif: A formal tool for analyzing software and hardware masked implementations . IACR Cryptology ePrint Archive 2018 (2018), 562 . Gilles Barthe, Sonia Bela\u00efd, Pierre-Alain Fouque, and Benjamin Gr\u00e9goire. 2018. maskVerif: A formal tool for analyzing software and hardware masked implementations. IACR Cryptology ePrint Archive 2018 (2018), 562.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660304"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54792-8_8"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.4.769"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024778"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40349-1_17"},{"key":"e_1_2_1_16_1","volume-title":"Gilles Van Assche, and Ronny Van Keer","author":"Bertoni Guido","year":"2013","unstructured":"Guido Bertoni , Joan Daemen , Michael Peeters , Gilles Van Assche, and Ronny Van Keer . 2013 . Keccak implementation overview. https:\/\/keccak.team\/files\/Keccak-implementation-3.2.pdf. Guido Bertoni, Joan Daemen, Michael Peeters, Gilles Van Assche, and Ronny Van Keer. 2013. Keccak implementation overview. https:\/\/keccak.team\/files\/Keccak-implementation-3.2.pdf."},{"key":"e_1_2_1_17_1","first-page":"303","article-title":"Theory of masking with codewords in hardware: Low-weight dth-order correlation-immune Boolean functions","volume":"2013","author":"Bhasin Shivam","year":"2013","unstructured":"Shivam Bhasin , Claude Carlet , and Sylvain Guilley . 2013 . Theory of masking with codewords in hardware: Low-weight dth-order correlation-immune Boolean functions . IACR Cryptology ePrint Archive 2013 (2013), 303 . Shivam Bhasin, Claude Carlet, and Sylvain Guilley. 2013. Theory of masking with codewords in hardware: Low-weight dth-order correlation-immune Boolean functions. IACR Cryptology ePrint Archive 2013 (2013), 303.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706179"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73721-8_4"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2635650"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_11"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_5"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54455-6_13"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183440.3195039"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788857.1788884"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 1722--1730","author":"Chakraborty Supratik","unstructured":"Supratik Chakraborty , Daniel J. Fremont , Kuldeep S. Meel , Sanjit A. Seshia , and Moshe Y. Vardi . 2014. Distribution-aware sampling and weighted model counting for SAT . In Proceedings of the AAAI Conference on Artificial Intelligence. 1722--1730 . Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. 2014. Distribution-aware sampling and weighted model counting for SAT. In Proceedings of the AAAI Conference on Artificial Intelligence. 1722--1730."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming. 200--216","author":"Chakraborty Supratik","unstructured":"Supratik Chakraborty , Kuldeep S. Meel , and Moshe Y. Vardi . 2013. A scalable approximate model counter . In Proceedings of the International Conference on Principles and Practice of Constraint Programming. 200--216 . Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. 2013. A scalable approximate model counter. In Proceedings of the International Conference on Principles and Practice of Constraint Programming. 200--216."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127041.3127044"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134058"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11212-1_13"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2016.7461358"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_4"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74735-2_3"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the International Workshop on Fast Software Encryption (FSE\u201913)","author":"Coron Jean-S\u00e9bastien","year":"2013","unstructured":"Jean-S\u00e9bastien Coron , Emmanuel Prouff , Matthieu Rivain , and Thomas Roche . 2013 . Higher-order side channel security and mask refreshing . In Proceedings of the International Workshop on Fast Software Encryption (FSE\u201913) . 410--424. Jean-S\u00e9bastien Coron, Emmanuel Prouff, Matthieu Rivain, and Thomas Roche. 2013. Higher-order side channel security and mask refreshing. In Proceedings of the International Workshop on Fast Software Encryption (FSE\u201913). 410--424."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the USENIX Security Symposium. 431--446","author":"Doychev Goran","year":"2013","unstructured":"Goran Doychev , Dominik Feld , Boris K\u00f6pf , Laurent Mauborgne , and Jan Reineke . 2013 . CacheAudit: A tool for the static analysis of cache side channels . In Proceedings of the USENIX Security Symposium. 431--446 . Goran Doychev, Dominik Feld, Boris K\u00f6pf, Laurent Mauborgne, and Jan Reineke. 2013. CacheAudit: A tool for the static analysis of cache side channels. In Proceedings of the USENIX Security Symposium. 431--446."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_8"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2685616"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54862-8_5"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593193"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2424951"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_19"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-014-0075-9"},{"key":"e_1_2_1_45_1","first-page":"711","article-title":"Composable masking schemes in the presence of physical defaults and the robust probing model","volume":"2017","author":"Faust Sebastian","year":"2017","unstructured":"Sebastian Faust , Vincent Grosso , Santos Merino Del Pozo , Clara Paglialonga , and Fran\u00e7ois-Xavier Standaert . 2017 . Composable masking schemes in the presence of physical defaults and the robust probing model . IACR Cryptology ePrint Archive 2017 (2017), 711 . Sebastian Faust, Vincent Grosso, Santos Merino Del Pozo, Clara Paglialonga, and Fran\u00e7ois-Xavier Standaert. 2017. Composable masking schemes in the presence of physical defaults and the robust probing model. IACR Cryptology ePrint Archive 2017 (2017), 711.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603097"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 3885--3892","author":"Fremont Daniel J.","unstructured":"Daniel J. Fremont , Markus N. Rabe , and Sanjit A. Seshia . 2017. Maximum model counting . In Proceedings of the AAAI Conference on Artificial Intelligence. 3885--3892 . Daniel J. Fremont, Markus N. Rabe, and Sanjit A. Seshia. 2017. Maximum model counting. In Proceedings of the AAAI Conference on Artificial Intelligence. 3885--3892."},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the NIST Non-invasive Attack Testing Workshop.","author":"Goodwill Gilbert","year":"2011","unstructured":"Gilbert Goodwill , Benjamin Jun , Josh Jaffe , and Pankaj Rohatgi . 2011 . A testing methodology for side channel resistance validation . In Proceedings of the NIST Non-invasive Attack Testing Workshop. Gilbert Goodwill, Benjamin Jun, Josh Jaffe, and Pankaj Rohatgi. 2011. A testing methodology for side channel resistance validation. In Proceedings of the NIST Non-invasive Attack Testing Workshop."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/648254.752571"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782574.1782590"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236028"},{"key":"e_1_2_1_52_1","volume-title":"Hachtel and Fabio Somenzi","author":"Gary","year":"1996","unstructured":"Gary D. Hachtel and Fabio Somenzi . 1996 . Logic Synthesis and Verification Algorithms. Kluwer . Gary D. Hachtel and Fabio Somenzi. 1996. Logic Synthesis and Verification Algorithms. Kluwer."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the International Cryptology Conference on Advances in Cryptology (CRYPTO\u201903)","author":"Ishai Yuval","unstructured":"Yuval Ishai , Amit Sahai , and David A. Wagner . 2003. Private circuits: Securing hardware against probing attacks . In Proceedings of the International Cryptology Conference on Advances in Cryptology (CRYPTO\u201903) . 463--481. Yuval Ishai, Amit Sahai, and David A. Wagner. 2003. Private circuits: Securing hardware against probing attacks. In Proceedings of the International Cryptology Conference on Advances in Cryptology (CRYPTO\u201903). 463--481."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/646761.706156"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703989"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_40"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1875868.1875871"},{"key":"e_1_2_1_58_1","first-page":"329","article-title":"Symbolic side-channel analysis for probabilistic programs","volume":"2018","author":"Malacaria Pasquale","year":"2018","unstructured":"Pasquale Malacaria , M. H. R. Khouzani , Corina S. Pasareanu , Quoc-Sang Phan , and Kasper S\u00f8e Luckow . 2018 . Symbolic side-channel analysis for probabilistic programs . IACR Cryptology ePrint Archive 2018 (2018), 329 . Pasquale Malacaria, M. H. R. Khouzani, Corina S. Pasareanu, Quoc-Sang Phan, and Kasper S\u00f8e Luckow. 2018. Symbolic side-channel analysis for probabilistic programs. IACR Cryptology ePrint Archive 2018 (2018), 329.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the International Workshop on Fast Software Encryption. 150--164","author":"Messerges Thomas S.","year":"2000","unstructured":"Thomas S. Messerges . 2000 . Securing the AES finalists against power analysis attacks . In Proceedings of the International Workshop on Fast Software Encryption. 150--164 . Thomas S. Messerges. 2000. Securing the AES finalists against power analysis attacks. In Proceedings of the International Workshop on Fast Software Encryption. 150--164."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046722"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008684.2008693"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33027-8_4"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/2492708.2492999"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/11502760_28"},{"key":"e_1_2_1_65_1","unstructured":"In\u00e8s Ben El Ouahma Quentin Meunier Karine Heydemann and Emmanuelle Encrenaz. 2017. Symbolic approach for side-channel resistance analysis of masked assembly codes. In Security Proofs for Embedded Systems.  In\u00e8s Ben El Ouahma Quentin Meunier Karine Heydemann and Emmanuelle Encrenaz. 2017. Symbolic approach for side-channel resistance analysis of masked assembly codes. In Security Proofs for Embedded Systems."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.34"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.34"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.8"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.8"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590328"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/2632362.2632367"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_9"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/646803.705980"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_37"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881511.1881549"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/11605805_14"},{"key":"e_1_2_1_77_1","unstructured":"Geoffrey Smith. 2009. On the foundations of quantitative information flow. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures Held as Part of the Joint European Conferences on Theory and Practice of Software. 288--302.  Geoffrey Smith. 2009. On the foundations of quantitative information flow. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures Held as Part of the Joint European Conferences on Theory and Practice of Software. 288--302."},{"key":"e_1_2_1_78_1","first-page":"138","article-title":"How (not) to use welch\u2019s T-test in side-channel security evaluations","volume":"2017","author":"Standaert Fran\u00e7ois-Xavier","year":"2017","unstructured":"Fran\u00e7ois-Xavier Standaert . 2017 . How (not) to use welch\u2019s T-test in side-channel security evaluations . IACR Cryptology ePrint Archive 2017 (2017), 138 . Fran\u00e7ois-Xavier Standaert. 2017. How (not) to use welch\u2019s T-test in side-channel security evaluations. IACR Cryptology ePrint Archive 2017 (2017), 138.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.5555\/3088723.3088767"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3240485"},{"key":"e_1_2_1_81_1","volume-title":"Proceedings of the IEEE European Symposium on Security and Privacy (EuroS8P\u201916)","author":"Val Celina G.","unstructured":"Celina G. Val , Michael A. Enescu , Sam Bayless , William Aiello , and Alan J. Hu . 2016. Precisely measuring quantitative information flow: 10K lines of code and beyond . In Proceedings of the IEEE European Symposium on Security and Privacy (EuroS8P\u201916) . 31--46. Celina G. Val, Michael A. Enescu, Sam Bayless, William Aiello, and Alan J. Hu. 2016. Precisely measuring quantitative information flow: 10K lines of code and beyond. In Proceedings of the IEEE European Symposium on Security and Privacy (EuroS8P\u201916). 31--46."},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3090064.3090071"},{"key":"e_1_2_1_83_1","volume-title":"Proceedings of the USENIX Security Symposium. 235--252","author":"Wang Shuai","year":"2017","unstructured":"Shuai Wang , Pei Wang , Xiao Liu , Danfeng Zhang , and Dinghao Wu . 2017 . CacheD: Identifying cache-based timing channels in production software . In Proceedings of the USENIX Security Symposium. 235--252 . Shuai Wang, Pei Wang, Xiao Liu, Danfeng Zhang, and Dinghao Wu. 2017. CacheD: Identifying cache-based timing channels in production software. In Proceedings of the USENIX Security Symposium. 235--252."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213851"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213851"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96142-2_12"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:26Z","timestamp":1750204406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,18]]},"references-count":85,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7,31]]}},"alternative-id":["10.1145\/3330392"],"URL":"https:\/\/doi.org\/10.1145\/3330392","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,18]]},"assertion":[{"value":"2018-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}