{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T05:09:27Z","timestamp":1785906567595,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765110","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:37:25Z","timestamp":1763854645000},"page":"4214-4228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["One-Sided Bounded Noise: Theory, Optimization Algorithms and Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3380-4518","authenticated-orcid":false,"given":"Hanshen","family":"Xiao","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA and NVIDIA, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6357-3515","authenticated-orcid":false,"given":"Jun","family":"Wan","sequence":"additional","affiliation":[{"name":"Five Rings, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5605-1048","authenticated-orcid":false,"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8253-7714","authenticated-orcid":false,"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_1_2_1","volume-title":"Luis Manuel Alvarez Tapia, and Billy Bob Brumley. Cache-timing attacks on rsa key generation. Cryptology ePrint Archive","author":"Aldaya Alejandro Cabrera","year":"2018","unstructured":"Alejandro Cabrera Aldaya, Cesar Pereida Garc\u00eda, Luis Manuel Alvarez Tapia, and Billy Bob Brumley. Cache-timing attacks on rsa key generation. Cryptology ePrint Archive, 2018."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96131-6"},{"key":"e_1_3_2_1_4_1","unstructured":"Paulo Barreto Vincent Rijmen and Antoon Bosselaers. Optimised ansi c code for the rijndael cipher."},{"key":"e_1_3_2_1_5_1","first-page":"464","volume-title":"Private empirical risk minimization: Efficient algorithms and tight error bounds. In 2014 IEEE 55th annual symposium on foundations of computer science","author":"Bassily Raef","year":"2014","unstructured":"Raef Bassily, Adam Smith, and Abhradeep Thakurta. Private empirical risk minimization: Efficient algorithms and tight error bounds. In 2014 IEEE 55th annual symposium on foundations of computer science, pages 464-473. IEEE, 2014."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the VLDB Endowment, 12(3)","author":"Bater Johes","year":"2018","unstructured":"Johes Bater, Xi He, William Ehrich, Ashwin Machanavajjhala, and Jennie Rogers. Shrinkwrap: efficient sql query processing in differentially private data federations. Proceedings of the VLDB Endowment, 12(3), 2018."},{"key":"e_1_3_2_1_7_1","unstructured":"Daniel J Bernstein. Cache-timing attacks on aes."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484786"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"e_1_3_2_1_11_1","volume-title":"Non-interactive differentially anonymous router. Cryptology ePrint Archive","author":"B\u00fcnz Benedikt","year":"2021","unstructured":"Benedikt B\u00fcnz, Yuncong Hu, Shin'ichiro Matsuo, and Elaine Shi. Non-interactive differentially anonymous router. Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_1_12_1","first-page":"209","volume-title":"OSDI","volume":"8","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, Dawson R Engler, et al. Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, volume 8, pages 209-224, 2008."},{"key":"e_1_3_2_1_13_1","volume-title":"The privacy-preserving padding problem: Non-negative mechanisms for conservative answers with differential privacy. arXiv preprint arXiv:2110.08177","author":"Case Benjamin M","year":"2021","unstructured":"Benjamin M Case, James Honaker, and Mahnush Movahedi. The privacy-preserving padding problem: Non-negative mechanisms for conservative answers with differential privacy. arXiv preprint arXiv:2110.08177, 2021."},{"key":"e_1_3_2_1_14_1","volume-title":"Foundations of differentially oblivious algorithms. ACM Journal of the ACM (JACM), 69(4):1-49","author":"Hubert Chan T-H","year":"2022","unstructured":"T-H Hubert Chan, Kai-Min Chung, Bruce Maggs, and Elaine Shi. Foundations of differentially oblivious algorithms. ACM Journal of the ACM (JACM), 69(4):1-49, 2022."},{"key":"e_1_3_2_1_15_1","volume-title":"Foundations of differentially oblivious algorithms. ACM Journal of the ACM (JACM), 69(4):1-49","author":"Hubert Chan T-H","year":"2022","unstructured":"T-H Hubert Chan, Kai-Min Chung, Bruce Maggs, and Elaine Shi. Foundations of differentially oblivious algorithms. ACM Journal of the ACM (JACM), 69(4):1-49, 2022."},{"key":"e_1_3_2_1_16_1","volume-title":"Elements of information theory","author":"Cover Thomas M","year":"1999","unstructured":"Thomas M Cover. Elements of information theory. John Wiley & Sons, 1999."},{"key":"e_1_3_2_1_17_1","first-page":"625","volume-title":"Conference on Learning Theory","author":"Dagan Yuval","year":"2022","unstructured":"Yuval Dagan and Gil Kur. A bounded-noise mechanism for differential privacy. In Conference on Learning Theory, pages 625-661. PMLR, 2022."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579371.3589073"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12454"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_1_25_1","volume-title":"Manuscript","author":"Gaboardi Marco","year":"2020","unstructured":"Marco Gaboardi, Michael Hay, and Salil Vadhan. A programming framework for opendp. Manuscript, May, 2020."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504967"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2962804"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_9"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132755"},{"key":"e_1_3_2_1_30_1","first-page":"571","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Lazar David","year":"2016","unstructured":"David Lazar and Nickolai Zeldovich. Alpenhorn: Bootstrapping secure communication without leaking metadata. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pages 571-586, 2016."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/CSF.2012.26","volume-title":"2012 IEEE 25th Computer Security Foundations Symposium","author":"M'rio S Alvim","year":"2012","unstructured":"S Alvim M'rio, Kostas Chatzikokolakis, Catuscia Palamidessi, and Geoffrey Smith. Measuring information leakage using generalized gain functions. In 2012 IEEE 25th Computer Security Foundations Symposium, pages 265-279. IEEE, 2012."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574267"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574267"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3304378"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2603151"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00034"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132783"},{"key":"e_1_3_2_1_39_1","first-page":"991","volume-title":"27th USENIX Security Symposium (USENIX Security 18)","author":"Bulck Jo Van","year":"2018","unstructured":"Jo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin, Baris Kasikci, Frank Piessens, Mark Silberstein, Thomas F Wenisch, Yuval Yarom, and Raoul Strackx. Foreshadow: Extracting the keys to the intel {SGX} kingdom with transient {Out-of-Order} execution. In 27th USENIX Security Symposium (USENIX Security 18), pages 991-1008, 2018."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_3_2_1_41_1","first-page":"10081","volume-title":"International Conference on Machine Learning","author":"Wang Di","year":"2020","unstructured":"Di Wang, Hanshen Xiao, Srinivas Devadas, and Jinhui Xu. On differentially private stochastic convex optimization with heavy-tailed data. In International Conference on Machine Learning, pages 10081-10091. PMLR, 2020."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CNS48642.2020.9162276"},{"key":"e_1_3_2_1_43_1","unstructured":"Hanshen Xiao. Automated and Provable Privatization for Black-Box Processing. PhD thesis Massachusetts Institute of Technology 2024."},{"key":"e_1_3_2_1_44_1","first-page":"611","volume-title":"Annual International Cryptology Conference","author":"Xiao Hanshen","year":"2023","unstructured":"Hanshen Xiao and Srinivas Devadas. Pac privacy: Automatic privacy measurement and control of data processing. In Annual International Cryptology Conference, pages 611-644. Springer, 2023."},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the 2024 ACM SIGSAC Conference on Computer and Communications Security","author":"Xiao Hanshen","year":"2024","unstructured":"Hanshen Xiao, G Edward Suh, and Srinivas Devadas. Formal privacy proof of data encoding: The possibility and impossibility of learnable obfuscation. In Proceedings of the 2024 ACM SIGSAC Conference on Computer and Communications Security, 2024."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623142"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179409"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453949"},{"key":"e_1_3_2_1_49_1","volume-title":"et al. Opacus: User-friendly differential privacy library in pytorch. arXiv preprint arXiv:2109.12298","author":"Yousefpour Ashkan","year":"2021","unstructured":"Ashkan Yousefpour, Igor Shilov, Alexandre Sablayrolles, Davide Testuggine, Karthik Prasad, Mani Malek, John Nguyen, Sayan Ghosh, Akash Bharadwaj, Jessica Zhao, et al. Opacus: User-friendly differential privacy library in pytorch. arXiv preprint arXiv:2109.12298, 2021."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30620-4_1"},{"key":"e_1_3_2_1_51_1","first-page":"4782","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Zhu Yuqing","year":"2022","unstructured":"Yuqing Zhu, Jinshuo Dong, and Yu-Xiang Wang. Optimal accounting of differential privacy via characteristic function. In International Conference on Artificial Intelligence and Statistics, pages 4782-4817. PMLR, 2022."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:22:15Z","timestamp":1766442135000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":51,"alternative-id":["10.1145\/3719027.3765110","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765110","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}