{"id":"https://openalex.org/W3216210238","doi":"https://doi.org/10.1145/3487063","title":"Universal Equivalence and Majority of Probabilistic Programs over Finite Fields","display_name":"Universal Equivalence and Majority of Probabilistic Programs over Finite Fields","publication_year":2021,"publication_date":"2021-11-22","ids":{"openalex":"https://openalex.org/W3216210238","doi":"https://doi.org/10.1145/3487063","mag":"3216210238"},"language":"en","primary_location":{"id":"doi:10.1145/3487063","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3487063","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-03468834","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075577852","display_name":"Gilles Barthe","orcid":"https://orcid.org/0000-0002-3853-1777"},"institutions":[{"id":"https://openalex.org/I4210087817","display_name":"Software (Germany)","ror":"https://ror.org/004g36n56","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210087817"]},{"id":"https://openalex.org/I4210096592","display_name":"Max Planck Institute for Security and Privacy","ror":"https://ror.org/00bj0r217","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210096592"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gilles Barthe","raw_affiliation_strings":["MPI-SP & IMDEA Software Institute, Bochum, Germany","Max Planck Institute for Security and Privacy [Bochum]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MPI-SP & IMDEA Software Institute, Bochum, Germany","institution_ids":["https://openalex.org/I4210087817","https://openalex.org/I4210096592"]},{"raw_affiliation_string":"Max Planck Institute for Security and Privacy [Bochum]","institution_ids":["https://openalex.org/I4210096592"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057561034","display_name":"Charlie Jacomme","orcid":"https://orcid.org/0009-0003-4465-3150"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Charlie Jacomme","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085316790","display_name":"Steve Kremer","orcid":"https://orcid.org/0009-0004-6946-0678"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Steve Kremer","raw_affiliation_strings":["LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine, Villers l\u00e9s Nancy","Proof techniques for security protocols"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine, Villers l\u00e9s Nancy","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I90183372"]},{"raw_affiliation_string":"Proof techniques for security protocols","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1301,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59684718,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"1","first_page":"1","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7363659739494324},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6770423054695129},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6227562427520752},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5889004468917847},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5499691963195801},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.527889609336853},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4272739589214325},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.41783347725868225},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3109086751937866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2867909371852875},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.11913260817527771}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7363659739494324},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6770423054695129},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6227562427520752},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5889004468917847},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5499691963195801},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.527889609336853},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4272739589214325},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.41783347725868225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3109086751937866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2867909371852875},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.11913260817527771},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3487063","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3487063","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03468834v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03468834","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 2022, 23 (1), pp.1-42. ⟨10.1145/3487063⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03468834v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03468834","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 2022, 23 (1), pp.1-42. ⟨10.1145/3487063⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W12758337","https://openalex.org/W42020886","https://openalex.org/W150877817","https://openalex.org/W206363498","https://openalex.org/W1527492684","https://openalex.org/W1528021357","https://openalex.org/W1561261246","https://openalex.org/W1714637014","https://openalex.org/W1733262075","https://openalex.org/W1797219784","https://openalex.org/W1972600569","https://openalex.org/W1975784724","https://openalex.org/W1989159237","https://openalex.org/W1994347831","https://openalex.org/W2014308048","https://openalex.org/W2015585803","https://openalex.org/W2026258357","https://openalex.org/W2049389441","https://openalex.org/W2054754886","https://openalex.org/W2069788171","https://openalex.org/W2092230546","https://openalex.org/W2141420453","https://openalex.org/W2142174533","https://openalex.org/W2334612034","https://openalex.org/W2400124473","https://openalex.org/W2477064046","https://openalex.org/W2477775364","https://openalex.org/W2493400082","https://openalex.org/W2498996213","https://openalex.org/W2550342065","https://openalex.org/W2571169473","https://openalex.org/W2604969030","https://openalex.org/W2797207385","https://openalex.org/W2808819080","https://openalex.org/W2952640400","https://openalex.org/W2963754540","https://openalex.org/W2964349030","https://openalex.org/W2985064942","https://openalex.org/W3006258735","https://openalex.org/W3017923731","https://openalex.org/W3029173733","https://openalex.org/W3029800901","https://openalex.org/W4247052524","https://openalex.org/W4247564011","https://openalex.org/W4292081273","https://openalex.org/W6608415941"],"related_works":["https://openalex.org/W1865715204","https://openalex.org/W2096284940","https://openalex.org/W2916830211","https://openalex.org/W2964662755","https://openalex.org/W1994637428","https://openalex.org/W2021535402","https://openalex.org/W4232397231","https://openalex.org/W2950141706","https://openalex.org/W1965531865","https://openalex.org/W1974626062"],"abstract_inverted_index":{"We":[0,42,162,203],"study":[1,186],"decidability":[2,131],"problems":[3,175,179],"for":[4,9,96,107,218],"equivalence":[5,71,95,191],"of":[6,18,46,78,99,103,138,189],"probabilistic":[7,12,174],"programs":[8,219],"a":[10,133,165,194],"core":[11],"programming":[13,22],"language":[14,23],"over":[15,54,72],"finite":[16,56],"fields":[17],"fixed":[19],"characteristic.":[20],"The":[21,48,82],"supports":[24],"uniform":[25],"sampling,":[26],"addition,":[27],"multiplication,":[28],"and":[29,31,39,132,150,176,206],"conditionals":[30],"thus":[32],"is":[33,115,216],"sufficiently":[34],"expressive":[35],"to":[36,93,153,159,168],"encode":[37],"Boolean":[38],"arithmetic":[40],"circuits.":[41],"consider":[43],"two":[44],"variants":[45,188],"equivalence:":[47],"first":[49,113],"one":[50,91],"considers":[51],"an":[52],"interpretation":[53],"the":[55,62,112,126,139,151,172,190],"field":[57],"F":[58,75,79,104],"q":[59,76,80],",":[60],"while":[61],"second":[63],"one,":[64],"which":[65,123],"we":[66,118,142,185,196],"call":[67,197],"universal":[68,83,140,173],"equivalence,":[69],"verifies":[70],"all":[73],"extensions":[74],"k":[77,106,109],".":[81,110],"variant":[84],"typically":[85],"arises":[86],"in":[87,125],"provable":[88],"cryptography":[89],"when":[90],"wishes":[92],"prove":[94],"any":[97,108],"length":[98],"bitstrings,":[100],"i.e.,":[101],"elements":[102],"2":[105],"While":[111],"problem":[114,195],"obviously":[116],"decidable,":[117],"establish":[119],"its":[120],"exact":[121],"complexity,":[122],"lies":[124],"counting":[127],"hierarchy.":[128],"To":[129],"show":[130],"doubly":[134],"exponential":[135],"upper":[136],"bound":[137],"variant,":[141],"rely":[143],"on":[144,180],"results":[145],"from":[146],"algorithmic":[147],"number":[148],"theory":[149],"possibility":[152],"compare":[154],"local":[155],"zeta":[156],"functions":[157],"associated":[158],"given":[160],"polynomials.":[161],"then":[163],"devise":[164],"general":[166],"way":[167],"draw":[169],"links":[170],"between":[171],"widely":[177],"studied":[178],"linear":[181],"recurrence":[182],"sequences.":[183],"Finally,":[184],"several":[187],"problem,":[192],"including":[193],"majority,":[198],"motivated":[199],"by":[200],"differential":[201],"privacy.":[202],"also":[204],"define":[205],"provide":[207],"some":[208],"insights":[209],"about":[210],"program":[211],"indistinguishability,":[212],"proving":[213],"that":[214],"it":[215],"decidable":[217],"always":[220],"returning":[221],"0":[222],"or":[223],"1.":[224]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}