{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:34:26Z","timestamp":1773192866259,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"IARPA","award":["RAMPARTS"],"award-info":[{"award-number":["RAMPARTS"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,11]]},"DOI":"10.1145\/3338469.3358945","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"57-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["RAMPARTS"],"prefix":"10.1145","author":[{"given":"David W.","family":"Archer","sequence":"first","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}]},{"given":"Jos\u00e9 Manuel","family":"Calder\u00f3n Trilla","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}]},{"given":"Jason","family":"Dagit","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}]},{"given":"Alex","family":"Malozemoff","sequence":"additional","affiliation":[{"name":"Galois, Inc., Portland, OR, USA"}]},{"given":"Yuriy","family":"Polyakov","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]},{"given":"Kurt","family":"Rohloff","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]},{"given":"Gerard","family":"Ryan","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"https:\/\/github.com\/CEA-LIST\/Cingulata","year":"2018","unstructured":"2018. Cingulata. ( 2018 ). https:\/\/github.com\/CEA-LIST\/Cingulata 2018. Cingulata. (2018). https:\/\/github.com\/CEA-LIST\/Cingulata"},{"key":"e_1_3_2_1_2_1","unstructured":"2018. The Crucible Symbolic Simulator. (2018). https:\/\/github.com\/GaloisInc\/crucible  2018. The Crucible Symbolic Simulator. (2018). https:\/\/github.com\/GaloisInc\/crucible"},{"key":"e_1_3_2_1_3_1","unstructured":"2018. TFHE: Fast Fully Homomorphic Encryption Library over the Torus. (2018).https:\/\/github.com\/tfhe\/tfhe  2018. TFHE: Fast Fully Homomorphic Encryption Library over the Torus. (2018).https:\/\/github.com\/tfhe\/tfhe"},{"key":"e_1_3_2_1_4_1","unstructured":"2018. The Z3 Theorem Prover. (2018). https:\/\/github.com\/Z3Prover\/z3  2018. The Z3 Theorem Prover. (2018). https:\/\/github.com\/Z3Prover\/z3"},{"key":"e_1_3_2_1_5_1","volume-title":"Jason Dagit, Alex J. Malozemoff, Yuriy Polyakov, Kurt Rohloff, and Gerard Ryan.","author":"Archer David W.","year":"2019","unstructured":"David W. Archer , Jose Manuel Calderon Trilla , Jason Dagit, Alex J. Malozemoff, Yuriy Polyakov, Kurt Rohloff, and Gerard Ryan. 2019 . RAMPARTS : A Programmer-Friendly System for Building Homomorphic Encryption Applications. Cryptology ePrint Archive, Report 2019\/988. (2019). https:\/\/eprint.iacr.org\/2019\/988. David W. Archer, Jose Manuel Calderon Trilla, Jason Dagit, Alex J. Malozemoff, Yuriy Polyakov, Kurt Rohloff, and Gerard Ryan. 2019. RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications. Cryptology ePrint Archive, Report 2019\/988. (2019). https:\/\/eprint.iacr.org\/2019\/988."},{"key":"e_1_3_2_1_7_1","volume-title":"Holmes","author":"Aslett Louis J. M.","year":"2015","unstructured":"Louis J. M. Aslett , Pedro M. Esperancca , and Chris C . Holmes . 2015 . A review of homomorphic encryption and software tools for encrypted statistical machine learning. arXiv preprint 1508.06574. (2015). https:\/\/arxiv.org\/abs\/1508.06574. Louis J. M. Aslett, Pedro M. Esperancca, and Chris C. Holmes. 2015. A review of homomorphic encryption and software tools for encrypted statistical machine learning. arXiv preprint 1508.06574. (2015). https:\/\/arxiv.org\/abs\/1508.06574."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: a system for secure multi-party computation. In ACM CCS 08 Peng Ning Paul F. Syverson and Somesh Jha (Eds.). ACM Press 257--266.  Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: a system for secure multi-party computation. In ACM CCS 08 Peng Ning Paul F. Syverson and Somesh Jha (Eds.). ACM Press 257--266.","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.08.006"},{"key":"e_1_3_2_1_10_1","volume-title":"Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS 2008 (LNCS), Sushil Jajodia and Javier L\u00f3pez (Eds.)","volume":"5283","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov , Sven Laur , and Jan Willemson . 2008 . Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS 2008 (LNCS), Sushil Jajodia and Javier L\u00f3pez (Eds.) , Vol. 5283 . Springer, Heidelberg, 192--206. Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS 2008 (LNCS), Sushil Jajodia and Javier L\u00f3pez (Eds.), Vol. 5283. Springer, Heidelberg, 192--206."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2014.04.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_13_1","volume-title":"ABC: An Academic Industrial-strength Verification Tool. In CAV.","author":"Brayton Robert","year":"2010","unstructured":"Robert Brayton and Alan Mishchenko . 2010 . ABC: An Academic Industrial-strength Verification Tool. In CAV. Robert Brayton and Alan Mishchenko. 2010. ABC: An Academic Industrial-strength Verification Tool. In CAV."},{"key":"e_1_3_2_1_14_1","first-page":"209","article-title":"KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs","volume":"8","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar , Daniel Dunbar , and Dawson R. Engler . 2008 . KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs . In OSDI , Vol. 8. 209 -- 224 . Cristian Cadar, Daniel Dunbar, and Dawson R. Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI, Vol. 8. 209--224.","journal-title":"OSDI"},{"key":"e_1_3_2_1_15_1","volume-title":"A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits","author":"Carpov Sergiu","unstructured":"Sergiu Carpov , Pascal Aubry , and Renaud Sirdey . 2018. A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits . In Combinatorial Algorithms, Ljiljana Brankovic, Joe Ryan, and William F. Smyth (Eds.). Springer International Publishing , Cham , 275--286. Sergiu Carpov, Pascal Aubry, and Renaud Sirdey. 2018. A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits. In Combinatorial Algorithms, Ljiljana Brankovic, Joe Ryan, and William F. Smyth (Eds.). Springer International Publishing, Cham, 275--286."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2732516.2732520"},{"key":"e_1_3_2_1_17_1","volume-title":"Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270","author":"Costello Craig","year":"2015","unstructured":"Craig Costello , C\u00e9dric Fournet , Jon Howell , Markulf Kohlweiss , Benjamin Kreuter , Michael Naehrig , Bryan Parno , and Samee Zahur . 2015 . Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270 . https:\/\/doi.org\/10.1109\/SP.2015.23 10.1109\/SP.2015.23 Craig Costello, C\u00e9dric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, and Samee Zahur. 2015. Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 253--270. https:\/\/doi.org\/10.1109\/SP.2015.23"},{"key":"e_1_3_2_1_18_1","first-page":"552","article-title":"Manual for using homomorphic encryption for bioinformatics","volume":"105","author":"Dowlin Nathan","year":"2017","unstructured":"Nathan Dowlin , Ran Gilad-Bachrach , Kim Laine , Kristin Lauter , Michael Naehrig , and John Wernsing . 2017 . Manual for using homomorphic encryption for bioinformatics . Proc. IEEE , Vol. 105 , 3 (2017), 552 -- 567 . Nathan Dowlin, Ran Gilad-Bachrach, Kim Laine, Kristin Lauter, Michael Naehrig, and John Wernsing. 2017. Manual for using homomorphic encryption for bioinformatics. Proc. IEEE, Vol. 105, 3 (2017), 552--567.","journal-title":"Proc. IEEE"},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Machine Learning. 201--210","author":"Gilad-Bachrach Ran","year":"2016","unstructured":"Ran Gilad-Bachrach , Nathan Dowlin , Kim Laine , Kristin Lauter , Micahel Naehrig , and John Wernsing . 2016 . Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy . In International Conference on Machine Learning. 201--210 . Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin Lauter, Micahel Naehrig, and John Wernsing. 2016. Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy. In International Conference on Machine Learning. 201--210."},{"key":"e_1_3_2_1_21_1","volume-title":"Topics in Cryptology -- CT-RSA","author":"Halevi Shai","year":"2019","unstructured":"Shai Halevi , Yuriy Polyakov , and Victor Shoup . 2019. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme . In Topics in Cryptology -- CT-RSA 2019 , Mitsuru Matsui (Ed.). Springer International Publishing , Cham, 83--105. Shai Halevi, Yuriy Polyakov, and Victor Shoup. 2019. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. In Topics in Cryptology -- CT-RSA 2019, Mitsuru Matsui (Ed.). Springer International Publishing, Cham, 83--105."},{"key":"e_1_3_2_1_22_1","volume-title":"https:\/\/github.com\/shaih\/HElib","author":"Halevi Shai","year":"2018","unstructured":"Shai Halevi and Victor Shoup . 2018. HElib. ( 2018 ). https:\/\/github.com\/shaih\/HElib Shai Halevi and Victor Shoup. 2018. HElib. (2018). https:\/\/github.com\/shaih\/HElib"},{"key":"e_1_3_2_1_23_1","volume-title":"GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18)","author":"Juvekar Chiraag","year":"2018","unstructured":"Chiraag Juvekar , Vinod Vaikuntanathan , and Anantha Chandrakasan . 2018 . GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18) . Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha Chandrakasan. 2018. GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.2254088"},{"key":"e_1_3_2_1_26_1","unstructured":"Kim Laine Hao Chen and Rachel Player. 2018. Simple Encrypted Arithmetic Library. (2018). https:\/\/sealcrypto.org  Kim Laine Hao Chen and Rachel Player. 2018. Simple Encrypted Arithmetic Library. (2018). https:\/\/sealcrypto.org"},{"key":"e_1_3_2_1_27_1","volume-title":"ObliVM: A Programming Framework for Secure Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 359--376","author":"Liu Chang","year":"2015","unstructured":"Chang Liu , Xiao Shaun Wang , Kartik Nayak , Yan Huang , and Elaine Shi . 2015 . ObliVM: A Programming Framework for Secure Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 359--376 . https:\/\/doi.org\/10.1109\/SP.2015.29 10.1109\/SP.2015.29 Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, and Elaine Shi. 2015. ObliVM: A Programming Framework for Secure Computation. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 359--376. https:\/\/doi.org\/10.1109\/SP.2015.29"},{"key":"e_1_3_2_1_28_1","volume-title":"Fairplay--A Secure Two-Party Computation System. USENIX Security Symposium","volume":"4","author":"Malkhi Dahlia","year":"2004","unstructured":"Dahlia Malkhi , Noam Nisan , Benny Pinkas , and Yaron Sella . 2004 . Fairplay--A Secure Two-Party Computation System. USENIX Security Symposium , Vol. 4 . San Diego, CA, USA, 9. Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. 2004. Fairplay--A Secure Two-Party Computation System. USENIX Security Symposium, Vol. 4. San Diego, CA, USA, 9."},{"key":"e_1_3_2_1_29_1","volume-title":"GraphSC: Parallel Secure Computation Made Easy. 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 377--394","author":"Nayak Kartik","year":"2015","unstructured":"Kartik Nayak , Xiao Shaun Wang , Stratis Ioannidis , Udi Weinsberg , Nina Taft , and Elaine Shi . 2015 . GraphSC: Parallel Secure Computation Made Easy. 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 377--394 . https:\/\/doi.org\/10.1109\/SP.2015.30 10.1109\/SP.2015.30 Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 377--394. https:\/\/doi.org\/10.1109\/SP.2015.30"},{"key":"e_1_3_2_1_30_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 238--252","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno , Jon Howell , Craig Gentry , and Mariana Raykova . 2013 . Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 238--252 . Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 238--252."},{"key":"e_1_3_2_1_31_1","volume-title":"Accessed","author":"Polyakov Yuriy","year":"2019","unstructured":"Yuriy Polyakov , Kurt Rohloff , and Gerard W. Ryan . Accessed August 2019 . PALISADE Lattice Cryptography Library . (Accessed August 2019). https:\/\/palisade-crypto.org\/ Yuriy Polyakov, Kurt Rohloff, and Gerard W. Ryan. Accessed August 2019. PALISADE Lattice Cryptography Library. (Accessed August 2019). https:\/\/palisade-crypto.org\/"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.48"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2639340"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338469.3358945","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338469.3358945","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338469.3358945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:48Z","timestamp":1750201968000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338469.3358945"}},"subtitle":["A Programmer-Friendly System for Building Homomorphic Encryption Applications"],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":30,"alternative-id":["10.1145\/3338469.3358945","10.1145\/3338469"],"URL":"https:\/\/doi.org\/10.1145\/3338469.3358945","relation":{},"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"2019-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}