{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T23:16:50Z","timestamp":1784330210827,"version":"3.55.0"},"reference-count":64,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T00:00:00Z","timestamp":1716249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>\n            Trace-based simulation is a widely used methodology for system design exploration. It relies on realistic traces that represent a range of behaviors necessary to be evaluated, containing a lot of information about the application, its inputs and the underlying system on which it was generated. Consequently, generating traces from real-world executions risks leakage of sensitive information. To prevent this, traces can be obfuscated before release. However, this can undermine their ideal utility, i.e., how realistically a program behavior was captured. To address this, we propose Camouflage, a novel obfuscation framework, designed with awareness of the necessary architectural properties required to preserve\n            <jats:italic>trace utility<\/jats:italic>\n            , while ensuring secrecy of the inputs used to generate the trace. Focusing on memory access traces, our extensive evaluation on various benchmarks shows that camouflaged traces preserve the performance measurements of the original execution, with an average \u03c4 correlation of 0.66. We model input secrecy as an input indistinguishability problem and show that the average security loss is 7.8%, which is better than traces generated from the state-of-the-art.\n          <\/jats:p>","DOI":"10.1145\/3650110","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T12:27:11Z","timestamp":1709209631000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Camouflage: Utility-Aware Obfuscation for Accurate Simulation of Sensitive Program Traces"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6949-5070","authenticated-orcid":false,"given":"Asmita","family":"Pal","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6836-8096","authenticated-orcid":false,"given":"Keerthana","family":"Desai","sequence":"additional","affiliation":[{"name":"Google, Mountain View, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0308-8787","authenticated-orcid":false,"given":"Rahul","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6886-7183","authenticated-orcid":false,"given":"Joshua","family":"San Miguel","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,21]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"2016. Championship branch prediction (CBP-5). (2016). https:\/\/jilp.org\/cbp2016\/"},{"key":"e_1_3_2_3_2","unstructured":"2017. Cache replacement championship (CRC-2). (2017). https:\/\/crc2.ece.tamu.edu\/"},{"key":"e_1_3_2_4_2","unstructured":"2017. ChampSim. (2017). https:\/\/github.com\/ChampSim\/"},{"key":"e_1_3_2_5_2","unstructured":"2018. Championship value prediction (CVP-1). (2018). https:\/\/www.microarch.org\/cvp1\/cvp1online\/program.html"},{"key":"e_1_3_2_6_2","unstructured":"2019. 3rd Data Prefetching Championship. (2019). https:\/\/dpc3.compas.cs.stonybrook.edu\/?final_programs"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926254"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2014.6835935"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00046"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/2665671.2665691"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2012.6169042"},{"key":"e_1_3_2_12_2","volume-title":"PERFECT (Power Efficiency Revolution For Embedded Computing Technologies) Benchmark Suite Manual","author":"Barker Kevin","year":"2013","unstructured":"Kevin Barker, Thomas H.Benson, Dan Campbell, David Ediger, Roberto Gioiosa, Adolfy Hoisie, Darren Kerbyson, Joseph Manzano, Andres Marquez, Leon Song, Nathan Tallent, and Antonino Tumeo. 2013. PERFECT (Power Efficiency Revolution For Embedded Computing Technologies) Benchmark Suite Manual. Pacific Northwest National Laboratory and Georgia Tech Research Institute. http:\/\/hpc.pnnl.gov\/projects\/PERFECT\/"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","unstructured":"Scott Beamer Krste Asanovi\u0107 and David Patterson. 2015. The GAP Benchmark Suite. 10.48550\/ARXIV.1508.03619","DOI":"10.48550\/ARXIV.1508.03619"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_18"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3185768.3185771"},{"key":"e_1_3_2_16_2","article-title":"SoK: Design tools for side-channel-aware implementions","author":"Buhan Ileana","year":"2021","unstructured":"Ileana Buhan, Lejla Batina, Yuval Yarom, and Patrick Schaumont. 2021. SoK: Design tools for side-channel-aware implementions. arXiv preprint arXiv:2104.08593 (2021).","journal-title":"arXiv preprint arXiv:2104.08593"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772963"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330723"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304074"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SEED51797.2021.00027"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2012.6237010"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2000.842273"},{"key":"e_1_3_2_23_2","first-page":"243","volume-title":"International Workshop on Information Security Applications","author":"Gallais Jean-Fran\u00e7ois","year":"2010","unstructured":"Jean-Fran\u00e7ois Gallais, Ilya Kizhvatov, and Michael Tunstall. 2010. Improved trace-driven cache-collision attacks against embedded AES implementations. In International Workshop on Information Security Applications. Springer, 243\u2013257."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.44"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2013.6671278"},{"key":"e_1_3_2_28_2","first-page":"39","volume-title":"Proceedings of the Workshop on Approaches and Applications of Inductive Programming, AAIP\u201907, September 17, 2007, Warsaw, Poland","author":"Itai Alon","year":"2007","unstructured":"Alon Itai and Michael Slavkin. 2007. Detecting data structures from traces. In Proceedings of the Workshop on Approaches and Applications of Inductive Programming, AAIP\u201907, September 17, 2007, Warsaw, Poland, Emanuel Kitzelmann and Ute Schmid (Eds.). 39\u201350. https:\/\/cogsys.uni-bamberg.de\/events\/aaip07\/aaip_print.pdf#page=47"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1815971"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2006.302734"},{"key":"e_1_3_2_31_2","unstructured":"A. Joshi L. Eeckhout and L. John. 2008. The return of synthetic benchmarks. Presented at the SPEC Benchmark Workshop San Francisco CA USA (2008) pp. 1\u201311."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/325164.325162"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2019.00044"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783763"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037701"},{"key":"e_1_3_2_37_2","article-title":"Defending against model stealing attacks using deceptive perturbations","volume":"1806","author":"Lee Taesung","year":"2018","unstructured":"Taesung Lee, Benjamin Edwards, Ian Molloy, and Dong Su. 2018. Defending against model stealing attacks using deceptive perturbations. CoRR abs\/1806.00054 (2018). arxiv:1806.00054http:\/\/arxiv.org\/abs\/1806.00054","journal-title":"CoRR"},{"key":"e_1_3_2_38_2","volume-title":"Google Workload Traces 2022","author":"Lee Victor","year":"2022","unstructured":"Victor Lee, Derek Bruening, and Parthasarathy Ranganathan. 2022. Google Workload Traces 2022. https:\/\/research.google\/resources\/datasets\/google-workload-traces-2022\/"},{"key":"e_1_3_2_39_2","article-title":"SNAP Datasets: Stanford Large Network Dataset Collection","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data","journal-title":"http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2013.11"},{"key":"e_1_3_2_41_2","volume-title":"Proceedings of the 37th International Conference on Machine Learning (ICML\u201920)","author":"Liu Evan Zheran","year":"2020","unstructured":"Evan Zheran Liu, Milad Hashemi, Kevin Swersky, Parthasarathy Ranganathan, and Junwhan Ahn. 2020. An imitation learning approach for cache replacement. In Proceedings of the 37th International Conference on Machine Learning (ICML\u201920). JMLR.org, Article 579, 11 pages."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13374-9_24"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/339647.339656"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/11605805_1"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00021"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.44"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3205289.3205323"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2017.7975273"},{"key":"e_1_3_2_50_2","article-title":"Pangloss: A novel Markov chain prefetcher","volume":"1906","author":"Papaphilippou Philippos","year":"2019","unstructured":"Philippos Papaphilippou, Paul H. J. Kelly, and Wayne Luk. 2019. Pangloss: A novel Markov chain prefetcher. CoRR abs\/1906.00877 (2019). arxiv:1906.00877http:\/\/arxiv.org\/abs\/1906.00877","journal-title":"CoRR"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2749473"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291034"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236238"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358319"},{"key":"e_1_3_2_55_2","volume-title":"Proceedings of the Network and Distributed System Security Symposium, NDSS 2011, San Diego, California, USA, 6th February - 9th February 2011","author":"Slowinska Asia","year":"2011","unstructured":"Asia Slowinska, Traian Stancescu, and Herbert Bos. 2011. Howard: A dynamic excavator for reverse engineering data structures. In Proceedings of the Network and Distributed System Security Symposium, NDSS 2011, San Diego, California, USA, 6th February - 9th February 2011. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2011\/howard-a-dynamic-excavator-for-reverse-engineering-data-structures"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2018.8573515"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.135552"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346307"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2017.7975274"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.36"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2015.7095815"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375536"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2155620.2155671"},{"key":"e_1_3_2_64_2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/HPDC.2006.1652136","volume-title":"2006 15th IEEE International Conference on High Performance Distributed Computing","author":"Gao Xiaofeng","year":"2006","unstructured":"Xiaofeng Gao, A. Snavely, and L. Carter. 2006. Path grammar guided trace compression and trace approximation. In 2006 15th IEEE International Conference on High Performance Distributed Computing. 57\u201368."},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487726.2487728"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3650110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:31Z","timestamp":1750291411000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,21]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3650110"],"URL":"https:\/\/doi.org\/10.1145\/3650110","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,21]]},"assertion":[{"value":"2023-10-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}