{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:43:17Z","timestamp":1760132597293,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["645865"],"award-info":[{"award-number":["645865"]}]},{"name":"ONR","award":["N000141512750"],"award-info":[{"award-number":["N000141512750"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394746","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"155-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Universal equivalence and majority of probabilistic programs over finite fields"],"prefix":"10.1145","author":[{"given":"Gilles","family":"Barthe","sequence":"first","affiliation":[{"name":"MPI-SP & IMDEA Software Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charlie","family":"Jacomme","sequence":"additional","affiliation":[{"name":"LSV, CNRS & ENS Paris-Saclay & Inria & Universit\u00e9 Paris-Saclay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Kremer","sequence":"additional","affiliation":[{"name":"LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/1970573"},{"key":"e_1_3_2_1_2_1","volume-title":"Automated Methods for Checking Differential Privacy. CoRR abs\/1910.04137","author":"Barthe Gilles","year":"2019","unstructured":"Gilles Barthe , Rohit Chadha , Vishal Jagannath , A. Prasad Sistla , and Mahesh Viswanathan . 2019. Automated Methods for Checking Differential Privacy. CoRR abs\/1910.04137 ( 2019 ). arXiv:1910.04137 http:\/\/arxiv.org\/abs\/1910.04137 Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, and Mahesh Viswanathan. 2019. Automated Methods for Checking Differential Privacy. CoRR abs\/1910.04137 (2019). arXiv:1910.04137 http:\/\/arxiv.org\/abs\/1910.04137"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17511-4_4"},{"key":"e_1_3_2_1_4_1","volume-title":"Symbolic Methods in Computational Cryptography Proofs. In 32nd IEEE Computer Security Foundations Symposium (CSF'19)","author":"Barthe Gilles","year":"2019","unstructured":"Gilles Barthe , Benjamin Gr\u00e9goire , Charlie Jacomme , Steve Kremer , and Pierre-Yves Strub . 2019 . Symbolic Methods in Computational Cryptography Proofs. In 32nd IEEE Computer Security Foundations Symposium (CSF'19) . IEEE Computer Society, 136--151. Gilles Barthe, Benjamin Gr\u00e9goire, Charlie Jacomme, Steve Kremer, and Pierre-Yves Strub. 2019. Symbolic Methods in Computational Cryptography Proofs. In 32nd IEEE Computer Security Foundations Symposium (CSF'19). IEEE Computer Society, 136--151."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594834.1480894"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Gilles Barthe Charlie Jacomme and Steve Kremer. 2020. Universal equivalence and majority on probabilistic programs over finite fields. (2020). https:\/\/hal.inria.fr\/hal-02552287  Gilles Barthe Charlie Jacomme and Steve Kremer. 2020. Universal equivalence and majority on probabilistic programs over finite fields. (2020). https:\/\/hal.inria.fr\/hal-02552287","DOI":"10.1145\/3373718.3394746"},{"key":"e_1_3_2_1_7_1","volume-title":"Fine-grained Semantics for Probabilistic Programs. In 27th European Symposium on Programming (ESOP'18)","volume":"10801","author":"Bichsel Benjamin","year":"2018","unstructured":"Benjamin Bichsel , Timon Gehr , and Martin Vechev . 2018 . Fine-grained Semantics for Probabilistic Programs. In 27th European Symposium on Programming (ESOP'18) (Lecture Notes in Computer Science) , Vol. 10801 . Springer, 145--185. Benjamin Bichsel, Timon Gehr, and Martin Vechev. 2018. Fine-grained Semantics for Probabilistic Programs. In 27th European Symposium on Programming (ESOP'18) (Lecture Notes in Computer Science), Vol. 10801. Springer, 145--185."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2373048"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_15"},{"key":"e_1_3_2_1_10_1","volume-title":"Asymmetric Distances for Approximate Differential Privacy. In 30th International Conference on Concurrency Theory (CONCUR","author":"Chistikov Dmitry","year":"2019","unstructured":"Dmitry Chistikov , Andrzej S Murawski , and David Purser . 2019 . Asymmetric Distances for Approximate Differential Privacy. In 30th International Conference on Concurrency Theory (CONCUR 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Dmitry Chistikov, Andrzej S Murawski, and David Purser. 2019. Asymmetric Distances for Approximate Differential Privacy. In 30th International Conference on Concurrency Theory (CONCUR 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/2372974"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Graham Everest Alf van der Poorten Igor Shparlinski and Thomas Ward. 2002. Exponential functions linear recurrence sequences and their applications.  Graham Everest Alf van der Poorten Igor Shparlinski and Thomas Ward. 2002. Exponential functions linear recurrence sequences and their applications.","DOI":"10.1090\/surv\/104"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603097"},{"key":"e_1_3_2_1_15_1","volume-title":"The Complexity of Verifying Circuits as Differentially Private. CoRR abs\/1911.03272","author":"Gaboardi Marco","year":"2019","unstructured":"Marco Gaboardi , Kobbi Nissim , and David Purser . 2019. The Complexity of Verifying Circuits as Differentially Private. CoRR abs\/1911.03272 ( 2019 ). arXiv:1911.03272 http:\/\/arxiv.org\/abs\/1911.03272 Marco Gaboardi, Kobbi Nissim, and David Purser. 2019. The Complexity of Verifying Circuits as Differentially Private. CoRR abs\/1911.03272 (2019). arXiv:1911.03272 http:\/\/arxiv.org\/abs\/1911.03272"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33167-1_33"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1976-0422281-1"},{"key":"e_1_3_2_1_19_1","volume-title":"Counting points on varieties over finite fields of small characteristic. arXiv preprint math\/0612147","author":"Lauder Alan GB","year":"2006","unstructured":"Alan GB Lauder and Daqing Wan . 2006. Counting points on varieties over finite fields of small characteristic. arXiv preprint math\/0612147 ( 2006 ). Alan GB Lauder and Daqing Wan. 2006. Counting points on varieties over finite fields of small characteristic. arXiv preprint math\/0612147 (2006)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_13"},{"volume-title":"Tutorials on the Foundations of Cryptography","author":"Lindell Yehuda","key":"e_1_3_2_1_21_1","unstructured":"Yehuda Lindell . 2017. How to Simulate It - A Tutorial on the Simulation Proof Technique . In Tutorials on the Foundations of Cryptography , Yehuda Lindell (Ed.). Springer International Publishing , 277--346. https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6 10.1007\/978-3-319-57048-8_6 Yehuda Lindell. 2017. How to Simulate It - A Tutorial on the Simulation Proof Technique. In Tutorials on the Foundations of Cryptography, Yehuda Lindell (Ed.). Springer International Publishing, 277--346. https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622797.1622798"},{"key":"e_1_3_2_1_23_1","unstructured":"Stefan Maubach. 2001. The automorphism group over finite fields. (2001).  Stefan Maubach. 2001. The automorphism group over finite fields. (2001)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.08.004"},{"key":"e_1_3_2_1_25_1","first-page":"63","article-title":"The distance between terms of an algebraic recurrence sequence","volume":"349","author":"Mignotte Maurice","year":"1984","unstructured":"Maurice Mignotte , Tarlok Nath Shorey , and Robert Tijdeman . 1984 . The distance between terms of an algebraic recurrence sequence . Journal f\u00fcr die reine und angewandte Mathematik 349 (1984), 63 -- 76 . Maurice Mignotte, Tarlok Nath Shorey, and Robert Tijdeman. 1984. The distance between terms of an algebraic recurrence sequence. Journal f\u00fcr die reine und angewandte Mathematik 349 (1984), 63--76.","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"e_1_3_2_1_26_1","volume-title":"Murawski and Jo\u00ebl Ouaknine","author":"Andrzej","year":"2005","unstructured":"Andrzej S. Murawski and Jo\u00ebl Ouaknine . 2005 . On Probabilistic Program Equivalence and Refinement. In CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings (Lecture Notes in Computer Science), Mart\u00edn Abadi and Luca de Alfaro (Eds.), Vol. 3653 . Springer , 156--170. https:\/\/doi.org\/10.1007\/11539452_15 10.1007\/11539452_15 Andrzej S. Murawski and Jo\u00ebl Ouaknine. 2005. On Probabilistic Program Equivalence and Refinement. In CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings (Lecture Notes in Computer Science), Mart\u00edn Abadi and Luca de Alfaro (Eds.), Vol. 3653. Springer, 156--170. https:\/\/doi.org\/10.1007\/11539452_15"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96569"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33512-9_3"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.27"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1988.5281"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116858"},{"key":"e_1_3_2_1_32_1","first-page":"609","article-title":"The problem of appearance of a zero in a linear recurrence sequence","volume":"38","author":"Vereshchagin NK","year":"1985","unstructured":"NK Vereshchagin . 1985 . The problem of appearance of a zero in a linear recurrence sequence . Mat. Zametki 38 , 2 (1985), 609 -- 615 . NK Vereshchagin. 1985. The problem of appearance of a zero in a linear recurrence sequence. Mat. Zametki 38, 2 (1985), 609--615.","journal-title":"Mat. Zametki"},{"key":"e_1_3_2_1_33_1","volume-title":"Numbers of solutions of equations in finite fields. Bulletin of the AMS","author":"Weil Andr\u00e9","year":"1949","unstructured":"Andr\u00e9 Weil . 1949. Numbers of solutions of equations in finite fields. Bulletin of the AMS ( 1949 ). Andr\u00e9 Weil. 1949. Numbers of solutions of equations in finite fields. Bulletin of the AMS (1949)."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394746","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3373718.3394746","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394746","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":32,"alternative-id":["10.1145\/3373718.3394746","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394746","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}