{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:12:51Z","timestamp":1755839571923,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175781","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-13","source":"Crossref","is-referenced-by-count":6,"title":["A Higher-Order Indistinguishability Logic for Cryptographic Reasoning"],"prefix":"10.1109","author":[{"given":"David","family":"Baelde","sequence":"first","affiliation":[{"name":"Univ Rennes,CNRS, IRISA,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Koutsos","sequence":"additional","affiliation":[{"name":"Inria,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Lallemand","sequence":"additional","affiliation":[{"name":"Univ Rennes,CNRS, IRISA,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"The Squirrel Prover repository","year":"0","key":"ref13"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00078"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535847"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833800"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"menezes","key":"ref37"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CSF54842.2022.9919665"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref31","first-page":"88","article-title":"An overview of the hybrid argument","author":"fischlin","year":"2021","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3127586"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2019.00041"},{"journal-title":"Source code of EasyCrypt","year":"2022","key":"ref33"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98989-1_18"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_18"},{"key":"ref2","first-page":"82","author":"blanchet","year":"2001","journal-title":"CSFW"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/2273708"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1609956.1609963"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9852-1"},{"key":"ref19","first-page":"107","article-title":"On counting propositional logic and wagner&#x2019;s hierarchy","volume":"3072","author":"antonelli","year":"2021","journal-title":"ICTC"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90037-2"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"36:1","DOI":"10.1145\/3290349","article-title":"A domain theory for statistical probabilistic programming","volume":"3","author":"v\u00e1k\u00e1r","year":"2019","journal-title":"Proc ACM Program Lang"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90167-A"},{"key":"ref26","first-page":"220","article-title":"Church: a language for generative models","author":"goodman","year":"2008","journal-title":"UAI"},{"key":"ref25","article-title":"A domain-theoretic approach to statistical programming languages","volume":"abs 2106 16190","author":"goubault-larrecq","year":"2021","journal-title":"CoRR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90019-V"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3531130.3533361"},{"journal-title":"Reasoning about uncertainty","year":"2005","author":"halpern","key":"ref21"},{"key":"ref28","first-page":"332","article-title":"Sequences of games: a tool for taming complexity in security proofs","author":"shoup","year":"2004","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LICS56636.2023.10175781"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1201\/b17668"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660276"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09341-z"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_48"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833653"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2007.1005"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2023,6,26]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175781.pdf?arnumber=10175781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T17:58:40Z","timestamp":1690912720000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175781","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}