{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:14:15Z","timestamp":1763507655461,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,4]]},"DOI":"10.1145\/1866307.1866350","type":"proceedings-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:38:23Z","timestamp":1286289503000},"page":"375-386","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Computational indistinguishability logic"],"prefix":"10.1145","author":[{"given":"Gilles","family":"Barthe","sequence":"first","affiliation":[{"name":"IMDEA Software, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marion","family":"Daubignard","sequence":"additional","affiliation":[{"name":"University of Grenoble, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Kapron","sequence":"additional","affiliation":[{"name":"University of Victoria, victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[{"name":"University of Grenoble, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2740"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0014-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_26"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948140"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1939141.1939145"},{"key":"e_1_3_2_1_6_1","volume-title":"Beyond Provable Security: Verifiable IND-CCA Security of OAEP","author":"Barthe Gilles","year":"2010","unstructured":"}} Gilles Barthe , Benjamin Gr \u00e9goire , Yassine Lakhnech , and Santiago Zanella B \u00e9guelin . Beyond Provable Security: Verifiable IND-CCA Security of OAEP , 2010 . Manuscript . }}Gilles Barthe, Benjamin Gr \u00e9goire, Yassine Lakhnech, and Santiago Zanella B \u00e9guelin. Beyond Provable Security: Verifiable IND-CCA Security of OAEP, 2010. Manuscript."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480894"},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Proceedings of EUROCRYPT'96","author":"Bellare Mihir","year":"1996","unstructured":"}} Mihir Bellare and Philipp Rogaway . The exact security of digital signatures -- How to sign with RSA and Rabin . In Proceedings of EUROCRYPT'96 , volume 1070 of Lecture Notes in Computer Science , pages 399 -- 416 . Springer-Verlag , 1996 . }}Mihir Bellare and Philipp Rogaway. The exact security of digital signatures -- How to sign with RSA and Rabin. In Proceedings of EUROCRYPT'96, volume 1070 of Lecture Notes in Computer Science, pages 399--416. Springer-Verlag, 1996."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_25"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368310.1368326"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_32"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-007-0032-1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455786"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_22"},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","first-page":"229","volume-title":"Proceedings of CRYPTO'00","author":"\u00e9bastien Coron Jean S","year":"2000","unstructured":"}} Jean S \u00e9bastien Coron . On the exact security of Full Domain Hash . In Proceedings of CRYPTO'00 , volume 1880 of Lecture Notes in Computer Science , pages 229 -- 235 . Springer-Verlag , 2000 . }}Jean S \u00e9bastien Coron. On the exact security of Full Domain Hash. In Proceedings of CRYPTO'00, volume 1880 of Lecture Notes in Computer Science, pages 229--235. Springer-Verlag, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455817"},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-540-77050-3_30","volume-title":"Proceedings of FSTTCS'07","author":"Courant Judica \u00ebl","year":"2007","unstructured":"}} Judica \u00ebl Courant , Cristian Ene , and Yassine Lakhnech . Computationally sound typing for non-interference: The case of deterministic encryption . In Proceedings of FSTTCS'07 , volume 4855 of Lecture Notes in Computer Science , pages 364 -- 375 . Springer , 2007 . }}Judica \u00ebl Courant, Cristian Ene, and Yassine Lakhnech. Computationally sound typing for non-interference: The case of deterministic encryption. In Proceedings of FSTTCS'07, volume 4855 of Lecture Notes in Computer Science, pages 364--375. Springer, 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_19"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.9"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2008.21"},{"key":"e_1_3_2_1_26_1","first-page":"454","volume-title":"Proceedings of AAAI'08","author":"Halpern Joseph Y.","year":"2008","unstructured":"}} Joseph Y. Halpern . From qualitative to quantitative proofs of security properties using first-order conditional logic . In Proceedings of AAAI'08 , pages 454 -- 459 , 2008 . }}Joseph Y. Halpern. From qualitative to quantitative proofs of security properties using first-order conditional logic. In Proceedings of AAAI'08, pages 454--459, 2008."},{"key":"e_1_3_2_1_27_1","first-page":"275","volume-title":"Proceedings of CSL'97","author":"Hofmann Martin","year":"1997","unstructured":"}} Martin Hofmann . A Mixed Modal\/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion . In Proceedings of CSL'97 , pages 275 -- 294 , 1997 . }}Martin Hofmann. A Mixed Modal\/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. In Proceedings of CSL'97, pages 275--294, 1997."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.008"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328479"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10230-1_3"},{"key":"e_1_3_2_1_31_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology -- CRYPTO","author":"Maurer Ueli","year":"2007","unstructured":"}} Ueli Maurer , Krzysztof Pietrzak , and Renato Renner . Indistinguishability amplification . In Alfred Menezes, editor, Advances in Cryptology -- CRYPTO 2007 , volume 4622 of Lecture Notes in Computer Science , pages 130 -- 149 . Springer-Verlag , August 2007. }}Ueli Maurer, Krzysztof Pietrzak, and Renato Renner. Indistinguishability amplification. In Alfred Menezes, editor, Advances in Cryptology -- CRYPTO 2007, volume 4622 of Lecture Notes in Computer Science, pages 130--149. Springer-Verlag, August 2007."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_10"},{"key":"e_1_3_2_1_33_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-540-24638-1_8","volume-title":"Proceedings of TCC'04","author":"Micciancio Daniele","year":"2004","unstructured":"}} Daniele Micciancio and Bogdan Warinschi . Soundness of formal encryption in the presence of active adversaries . In Proceedings of TCC'04 , volume 2951 of Lecture Notes in Computer Science , pages 133 -- 151 . Springer , 2004 . }}Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings of TCC'04, volume 2951 of Lecture Notes in Computer Science, pages 133--151. Springer, 2004."},{"key":"e_1_3_2_1_34_1","first-page":"3","volume-title":"Proceedings of LICS'01","author":"Mitchell John C.","year":"2001","unstructured":"}} John C. Mitchell , A. Ramanathan , Andre Scedrov , and Vanessa Teague . Probabilistic Polynominal-Time process calculus and security protocol analysis . In Proceedings of LICS'01 , pages 3 -- 8 . IEEE Computer Society , 2001 . }}John C. Mitchell, A. Ramanathan, Andre Scedrov, and Vanessa Teague. Probabilistic Polynominal-Time process calculus and security protocol analysis. In Proceedings of LICS'01, pages 3--8. IEEE Computer Society, 2001."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785001.1785034"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2007.8"},{"key":"e_1_3_2_1_37_1","volume-title":"Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint 2004\/332","author":"Shoup Victor","year":"2004","unstructured":"}} Victor Shoup . Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint 2004\/332 , 2004 . }}Victor Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint 2004\/332, 2004."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"}}\n      Jacques\n      Stern\n    .\n  Why provable security matters? In Advances in Cryptology -- EUROCRYPT'03 volume \n  2656\n   of \n  Lecture Notes in Computer Science pages \n  449\n  --\n  461\n  . \n  Springer-Verlag 2003\n  .   }}Jacques Stern. Why provable security matters? In Advances in Cryptology -- EUROCRYPT'03 volume 2656 of Lecture Notes in Computer Science pages 449--461. Springer-Verlag 2003.","DOI":"10.1007\/3-540-39200-9_28"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_29"}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Chicago Illinois USA","acronym":"CCS '10"},"container-title":["Proceedings of the 17th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866350","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866307.1866350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:59Z","timestamp":1750248539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":38,"alternative-id":["10.1145\/1866307.1866350","10.1145\/1866307"],"URL":"https:\/\/doi.org\/10.1145\/1866307.1866350","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}