{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:13:44Z","timestamp":1763968424227,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Office of Naval Research","award":["N00014-17-1-2787"],"award-info":[{"award-number":["N00014-17-1-2787"]}]},{"name":"National Science Foundation","award":["CNS-1562888,CNS-1565208,CCF-1553168"],"award-info":[{"award-number":["CNS-1562888,CNS-1565208,CCF-1553168"]}]},{"name":"DARPA","award":["W911NF-16-1-0389"],"award-info":[{"award-number":["W911NF-16-1-0389"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,9]]},"DOI":"10.1145\/3411497.3420212","type":"proceedings-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T20:59:15Z","timestamp":1604955555000},"page":"101-115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms"],"prefix":"10.1145","author":[{"given":"Samuel","family":"Judson","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Luo","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Antonopoulos","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruzica","family":"Piskac","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"e_1_3_2_1_2_1","volume-title":"Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '15)","author":"Albrecht Martin R.","year":"2015","unstructured":"Martin R. Albrecht , Christian Rechberger , Thomas Schneider , Tyge Tiessen , and Michael Zohner . 2015 . Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '15) . Springer, 430--454. Martin R. Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. 2015. Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '15). Springer, 430--454."},{"key":"e_1_3_2_1_4_1","first-page":"1749","article-title":"From Keys to Databases -- Real-World Applications of Secure Multi-Party","volume":"61","author":"Archer David W.","year":"2018","unstructured":"David W. Archer , Dan Bogdanov , Yehuda Lindell , Liina Kamm , Kurt Nielsen , Jakob Illeborg Pagter , Nigel P. Smart , and Rebecca N. Wright . 2018 . From Keys to Databases -- Real-World Applications of Secure Multi-Party Computation. Comput. J. , Vol. 61 , 12 (2018), 1749 -- 1771 . David W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P. Smart, and Rebecca N. Wright. 2018. From Keys to Databases -- Real-World Applications of Secure Multi-Party Computation. Comput. J., Vol. 61, 12 (2018), 1749--1771.","journal-title":"Computation. Comput. J."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594299"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_7_1","first-page":"1393","article-title":"SoK: Computer-Aided Cryptography","volume":"2019","author":"Barbosa Manuel","year":"2019","unstructured":"Manuel Barbosa , Gilles Barthe , Karthikeyan Bhargavan , Bruno Blanchet , Cas Cremers , Kevin Liao , and Bryan Parno . 2019 . SoK: Computer-Aided Cryptography . IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 1393 . Manuel Barbosa, Gilles Barthe, Karthikeyan Bhargavan, Bruno Blanchet, Cas Cremers, Kevin Liao, and Bryan Parno. 2019. SoK: Computer-Aided Cryptography. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 1393.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_9_1","volume-title":"SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. In Annual International Cryptology Conference (CRYPTO '13)","author":"Ben-Sasson Eli","year":"2013","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Daniel Genkin , Eran Tromer , and Madars Virza . 2013 . SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. In Annual International Cryptology Conference (CRYPTO '13) . Springer, 90--108. Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza. 2013. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. In Annual International Cryptology Conference (CRYPTO '13). Springer, 90--108."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_3_2_1_11_1","volume-title":"Privacy-Preserving Graph Algorithms in the Semi-Honest Model. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '05)","author":"Brickell Justin","year":"2005","unstructured":"Justin Brickell and Vitaly Shmatikov . 2005 . Privacy-Preserving Graph Algorithms in the Semi-Honest Model. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '05) . Springer, 236--252. Justin Brickell and Vitaly Shmatikov. 2005. Privacy-Preserving Graph Algorithms in the Semi-Honest Model. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '05). Springer, 236--252."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_13_1","volume-title":"Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In 26th Annual Symposium on Foundations of Computer Science (FOCS '85)","author":"Chor Benny","year":"1985","unstructured":"Benny Chor , Shafi Goldwasser , Silvio Micali , and Baruch Awerbuch . 1985 . Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In 26th Annual Symposium on Foundations of Computer Science (FOCS '85) . IEEE, 383--395. Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In 26th Annual Symposium on Foundations of Computer Science (FOCS '85). IEEE, 383--395."},{"volume-title":"Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In Workshop on Logic of Programs. Springer, 52--71","author":"Clarke Edmund M.","key":"e_1_3_2_1_14_1","unstructured":"Edmund M. Clarke and E. Allen Emerson . 1981 . Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In Workshop on Logic of Programs. Springer, 52--71 . Edmund M. Clarke and E. Allen Emerson. 1981. Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In Workshop on Logic of Programs. Springer, 52--71."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"volume-title":"Handbook of Model Checking","author":"Clarke Edmund M.","key":"e_1_3_2_1_16_1","unstructured":"Edmund M. Clarke , Thomas A. Henzinger , Helmut Veith , and Roderick Bloem . 2018. Handbook of Model Checking . Vol. 10 . Springer . Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem. 2018. Handbook of Model Checking. Vol. 10. Springer."},{"key":"e_1_3_2_1_17_1","unstructured":"Edmund M. Clarke  Jr. Orna Grumberg Daniel Kroening Doron Peled and Helmut Veith. 2018. Model Checking. MIT Press.  Edmund M. Clarke Jr. Orna Grumberg Daniel Kroening Doron Peled and Helmut Veith. 2018. Model Checking. MIT Press."},{"key":"e_1_3_2_1_18_1","volume-title":"A Language for Probabilistically Oblivious Computation . arXiv preprint arXiv:1711.09305","author":"Darais David","year":"2017","unstructured":"David Darais , Chang Liu , Ian Sweet , and Michael Hicks . 2017. A Language for Probabilistically Oblivious Computation . arXiv preprint arXiv:1711.09305 ( 2017 ). David Darais, Chang Liu, Ian Sweet, and Michael Hicks. 2017. A Language for Probabilistically Oblivious Computation . arXiv preprint arXiv:1711.09305 (2017)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/242223.242257"},{"key":"e_1_3_2_1_20_1","volume-title":"Network and Distributed Systems Symposium (NDSS '11)","author":"Egele Manuel","year":"2011","unstructured":"Manuel Egele , Christopher Kruegel , Engin Kirda , and Giovanni Vigna . 2011 . PiOS: Detecting Privacy Leaks in iOS Applications . In Network and Distributed Systems Symposium (NDSS '11) . 177--183. Manuel Egele, Christopher Kruegel, Engin Kirda, and Giovanni Vigna. 2011. PiOS: Detecting Privacy Leaks in iOS Applications. In Network and Distributed Systems Symposium (NDSS '11). 177--183."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619091"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869796"},{"key":"e_1_3_2_1_23_1","volume-title":"Official Journal of the European Union (OJ)","author":"European Parliament and Council. 2016. Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 April 2016 on the Protection of Natural Persons with Regard to the Processing of Personal Data and on the Free Movement of Such Data, and Repealing Directive 95\/46 (General Data Protection Regulation).","year":"2016","unstructured":"European Parliament and Council. 2016. Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 April 2016 on the Protection of Natural Persons with Regard to the Processing of Personal Data and on the Free Movement of Such Data, and Repealing Directive 95\/46 (General Data Protection Regulation). Official Journal of the European Union (OJ) ( 2016 ). European Parliament and Council. 2016. Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 April 2016 on the Protection of Natural Persons with Regard to the Processing of Personal Data and on the Free Movement of Such Data, and Repealing Directive 95\/46 (General Data Protection Regulation). Official Journal of the European Union (OJ) (2016)."},{"volume-title":"Foundations of Cryptography","author":"Goldreich Oded","key":"e_1_3_2_1_24_1","unstructured":"Oded Goldreich . 2009. Foundations of Cryptography : Volume 2 , Basic Applications. Cambridge University Press . Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_27_1","volume-title":"Data-Oblivious Graph Drawing Model and Algorithms. arXiv preprint arXiv:1209.0756","author":"Goodrich Michael T.","year":"2012","unstructured":"Michael T. Goodrich , Olga Ohrimenko , and Roberto Tamassia . 2012. Data-Oblivious Graph Drawing Model and Algorithms. arXiv preprint arXiv:1209.0756 ( 2012 ). Michael T. Goodrich, Olga Ohrimenko, and Roberto Tamassia. 2012. Data-Oblivious Graph Drawing Model and Algorithms. arXiv preprint arXiv:1209.0756 (2012)."},{"key":"e_1_3_2_1_28_1","volume-title":"Simons","author":"Goodrich Michael T.","year":"2014","unstructured":"Michael T. Goodrich and Joseph A . Simons . 2014 . Data-Oblivious Graph Algorithms in Outsourced External Memory. In International Conference on Combinatorial Optimization and Applications. Springer , 241--257. Michael T. Goodrich and Joseph A. Simons. 2014. Data-Oblivious Graph Algorithms in Outsourced External Memory. In International Conference on Combinatorial Optimization and Applications. Springer, 241--257."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 430--443","author":"Grassi Lorenzo","key":"e_1_3_2_1_30_1","unstructured":"Lorenzo Grassi , Christian Rechberger , Dragos Rotaru , Peter Scholl , and Nigel P. Smart . 2016. MPC-Friendly Symmetric Key Primitives . In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 430--443 . Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, and Nigel P. Smart. 2016. MPC-Friendly Symmetric Key Primitives. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 430--443."},{"key":"e_1_3_2_1_31_1","volume-title":"SoK: General-Purpose Compilers for Secure Multi-Party Computation. In 2019 IEEE Symposium on Security and Privacy (S&P '19)","author":"Hastings Marcella","year":"2019","unstructured":"Marcella Hastings , Brett Hemenway , Daniel Noble , and Steve Zdancewic . 2019 . SoK: General-Purpose Compilers for Secure Multi-Party Computation. In 2019 IEEE Symposium on Security and Privacy (S&P '19) . Marcella Hastings, Brett Hemenway, Daniel Noble, and Steve Zdancewic. 2019. SoK: General-Purpose Compilers for Secure Multi-Party Computation. In 2019 IEEE Symposium on Security and Privacy (S&P '19)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_34_1","volume-title":"Extending Oblivious Transfers Efficiently. In Annual International Cryptology Conference (CRYPTO '03)","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai , Joe Kilian , Kobbi Nissim , and Erez Petrank . 2003 . Extending Oblivious Transfers Efficiently. In Annual International Cryptology Conference (CRYPTO '03) . Springer, 145--161. Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In Annual International Cryptology Conference (CRYPTO '03). Springer, 145--161."},{"key":"e_1_3_2_1_35_1","volume-title":"The New York Times ( April 27th, 2019","author":"Nicas Jack","year":"2019","unstructured":"Jack Nicas . April 27th , 2019 . Apple Cracks Down on Apps That Fight iPhone Addiction . The New York Times ( April 27th, 2019 ). Accessed November 11th , 2019 at https:\/\/www.nytimes.com\/2019\/04\/27\/technology\/apple-screen-time-trackers.htm%l. Jack Nicas. April 27th, 2019. Apple Cracks Down on Apps That Fight iPhone Addiction . The New York Times ( April 27th, 2019). Accessed November 11th, 2019 at https:\/\/www.nytimes.com\/2019\/04\/27\/technology\/apple-screen-time-trackers.htm%l."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516662"},{"volume-title":"Introduction to Modern Cryptography","author":"Katz Jonathan","key":"e_1_3_2_1_37_1","unstructured":"Jonathan Katz and Yehuda Lindell . 2014. Introduction to Modern Cryptography . Chapman and Hall\/CRC. Jonathan Katz and Yehuda Lindell. 2014. Introduction to Modern Cryptography. Chapman and Hall\/CRC."},{"key":"e_1_3_2_1_38_1","first-page":"184","article-title":"Efficiently Enforcing Input Validity in Secure Two-Party Computation","volume":"2016","author":"Katz Jonathan","year":"2016","unstructured":"Jonathan Katz , Alex J. Malozemoff , and Xiao Wang . 2016 . Efficiently Enforcing Input Validity in Secure Two-Party Computation . IACR Cryptol. ePrint Arch. , Vol. 2016 (2016), 184 . Jonathan Katz, Alex J. Malozemoff, and Xiao Wang. 2016. Efficiently Enforcing Input Validity in Secure Two-Party Computation . IACR Cryptol. ePrint Arch., Vol. 2016 (2016), 184.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_39_1","volume-title":"Actively Secure OT Extension with Optimal Overhead. In Annual International Cryptology Conference (CRYPTO '15)","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller , Emmanuela Orsini , and Peter Scholl . 2015 . Actively Secure OT Extension with Optimal Overhead. In Annual International Cryptology Conference (CRYPTO '15) . Springer, 724--741. Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In Annual International Cryptology Conference (CRYPTO '15). Springer, 724--741."},{"key":"e_1_3_2_1_40_1","volume-title":"Oblivious Data Structures for MPC. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '14)","author":"Keller Marcel","year":"2014","unstructured":"Marcel Keller and Peter Scholl . 2014 . Efficient , Oblivious Data Structures for MPC. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '14) . Springer, 506--525. Marcel Keller and Peter Scholl. 2014. Efficient, Oblivious Data Structures for MPC. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '14). Springer, 506--525."},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Kolesnikov Vladimir","key":"e_1_3_2_1_41_1","unstructured":"Vladimir Kolesnikov and Thomas Schneider . 2008. Improved Garbled Circuit: Free XOR Gates and Applications . In International Colloquium on Automata, Languages, and Programming . Springer , 486--498. Vladimir Kolesnikov and Thomas Schneider. 2008. Improved Garbled Circuit: Free XOR Gates and Applications. In International Colloquium on Automata, Languages, and Programming. Springer, 486--498."},{"volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '07)","author":"Lindell Yehuda","key":"e_1_3_2_1_42_1","unstructured":"Yehuda Lindell and Benny Pinkas . 2007. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries . In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '07) . Springer , 52--78. Yehuda Lindell and Benny Pinkas. 2007. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '07). Springer, 52--78."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9107-0"},{"key":"e_1_3_2_1_45_1","volume-title":"Memory Trace Oblivious Program Execution. In 2013 IEEE 26th Computer Security Foundations Symposium (CSF '13)","author":"Liu Chang","year":"2013","unstructured":"Chang Liu , Michael Hicks , and Elaine Shi . 2013 . Memory Trace Oblivious Program Execution. In 2013 IEEE 26th Computer Security Foundations Symposium (CSF '13) . IEEE, 51--65. Chang Liu, Michael Hicks, and Elaine Shi. 2013. Memory Trace Oblivious Program Execution. In 2013 IEEE 26th Computer Security Foundations Symposium (CSF '13). IEEE, 51--65."},{"key":"e_1_3_2_1_46_1","volume-title":"Oblivm: A Programming Framework for Secure Computation. In 2015 IEEE Symposium on Security and Privacy (S&P'15)","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 (S&P'15) . IEEE, 359--376. 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 (S&P'15). IEEE, 359--376."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382223"},{"key":"e_1_3_2_1_48_1","volume-title":"Secure Computation. In Proceedings of the 11th Annual International Cryptology Conference (CRYPTO '91)","author":"Micali Silvio","year":"1991","unstructured":"Silvio Micali and Phillip Rogaway . 1991 . Secure Computation. In Proceedings of the 11th Annual International Cryptology Conference (CRYPTO '91) . Springer, 392--404. Silvio Micali and Phillip Rogaway. 1991. Secure Computation. In Proceedings of the 11th Annual International Cryptology Conference (CRYPTO '91). Springer, 392--404."},{"key":"e_1_3_2_1_49_1","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '09)","author":"Schneider Benny","year":"2009","unstructured":"Pinkas, Benny and Schneider , Thomas and Smart , Nigel P. and Williams , Stephen C. 2009 . Secure Two-Party Computation is Practical . In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '09) . Springer, 250--267. Pinkas, Benny and Schneider, Thomas and Smart, Nigel P. and Williams, Stephen C. 2009. Secure Two-Party Computation is Practical. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '09). Springer, 250--267."},{"key":"e_1_3_2_1_50_1","volume-title":"The Temporal Logic of Programs. In 18th Annual Symposium on Foundations of Computer Science (FOCS '77)","author":"Pnueli Amir","year":"1977","unstructured":"Amir Pnueli . 1977 . The Temporal Logic of Programs. In 18th Annual Symposium on Foundations of Computer Science (FOCS '77) . IEEE, 46--57. Amir Pnueli. 1977. The Temporal Logic of Programs. In 18th Annual Symposium on Foundations of Computer Science (FOCS '77). IEEE, 46--57."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.48"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133979"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660314"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592434.1592436"},{"volume-title":"Privacy-Preserving Shortest Path Computation. In 23rd Annual Network and Distributed System Security Symposium (NDSS '16)","author":"Wu David J.","key":"e_1_3_2_1_56_1","unstructured":"David J. Wu , Joe Zimmerman , J\u00e9r\u00e9 my Planul , and John C. Mitchell . 2016 . Privacy-Preserving Shortest Path Computation. In 23rd Annual Network and Distributed System Security Symposium (NDSS '16) . David J. Wu, Joe Zimmerman, J\u00e9r\u00e9 my Planul, and John C. Mitchell. 2016. Privacy-Preserving Shortest Path Computation. In 23rd Annual Network and Distributed System Security Symposium (NDSS '16)."},{"key":"e_1_3_2_1_57_1","volume-title":"27th Annual Symposium on Foundations of Computer Science (FOCS '86)","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to Generate and Exchange Secrets . In 27th Annual Symposium on Foundations of Computer Science (FOCS '86) . IEEE, 162--167. Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In 27th Annual Symposium on Foundations of Computer Science (FOCS '86). IEEE, 162--167."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event USA","acronym":"CCS '20"},"container-title":["Proceedings of the 19th Workshop on Privacy in the Electronic Society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411497.3420212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3411497.3420212","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3411497.3420212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:41Z","timestamp":1750195901000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411497.3420212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":56,"alternative-id":["10.1145\/3411497.3420212","10.1145\/3411497"],"URL":"https:\/\/doi.org\/10.1145\/3411497.3420212","relation":{},"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"2020-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}