{"id":13,"date":"2015-06-15T10:26:53","date_gmt":"2015-06-15T08:26:53","guid":{"rendered":"http:\/\/members.loria.fr\/thierrygartiser\/?page_id=13"},"modified":"2024-09-03T08:28:26","modified_gmt":"2024-09-03T06:28:26","slug":"publications","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/ADebant\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<h4> Thesis <\/h4>\n<ul>\n<li>\nSymbolic verification of distance-bounding protocols &#8211; Application to payment protocols.<br \/>Alexandre Debant<br \/>\nDefended on November 17th, 2020 at IRISA, Rennes, France<br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/manuscript.pdf\">[manuscript]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/slides.pdf\">[slides]<\/a><\/li>\n<p> \n <\/ul>\n<p>\n &nbsp; <\/p>\n<h4> Journal papers<\/h4>\n<ul>\n<li>\nSo near and yet so far &#8211; Symbolic verification of distance-bounding protocols.<br \/>Alexandre Debant, <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a>, and <a href=\"http:\/\/people.rennes.inria.fr\/Cyrille.Wiedling\/\">Cyrille Wiedling<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/dl.acm.org\/journal\/tops\">ACM Transactions on Privacy and Security (TOPS)<\/a> (TISSEC pre 2018)<br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/tops-21\/tops-21.pdf\">[pdf]<\/a><\/li>\n<p> \n <\/ul>\n<p>\n &nbsp; <\/p>\n<h4> Conference papers <\/h4>\n<ul>\n<li>\nElection Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility.<br \/><a href=\"https:\/\/members.loria.fr\/VCortier\/\">V\u00e9ronique Cortier<\/a>, Alexandre Debant, Anselme Goetschmann, and <a href=\"https:\/\/members.loria.fr\/LHirschi\/\">Lucca Hirschi<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/www.usenix.org\/conference\/usenixsecurity24\">33nd USENIX Security Symposium, 2024<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/cortier\">[usenix]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/eprint.iacr.org\/2024\/261\">[eprint]<\/a><\/li>\n<p> <\/p>\n<li>\nCode voting: when simplicity meets security.<br \/><a href=\"https:\/\/members.loria.fr\/VCortier\/\">V\u00e9ronique Cortier<\/a>, Alexandre Debant, and <a href=\"https:\/\/members.loria.fr\/FMoser\/\">Florian Moser<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/esorics2024.org\/\">European Symposium on Research in Computer Security (ESORICS) 2024<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/inria.hal.science\/hal-04627733\/\">[hal]<\/a><\/li>\n<p> <\/p>\n<li>\nReversing, Breaking, and Fixing the French Legislative Election E-Voting Protocol.<br \/>Alexandre Debant, and <a href=\"https:\/\/members.loria.fr\/LHirschi\/\">Lucca Hirschi<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/www.usenix.org\/conference\/usenixsecurity23\">32nd USENIX Security Symposium, 2023<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/debant\">[usenix]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/eprint.iacr.org\/2022\/1653\">[eprint]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/hal.inria.fr\/hal-03875463\">[hal]<\/a><\/li>\n<p> <\/p>\n<li>\nElection Verifiability with ProVerif.<br \/><a href=\"https:\/\/chevalvi.gitlabpages.inria.fr\/chevalvi\/\">Vincent Cheval<\/a>, <a href=\"https:\/\/members.loria.fr\/VCortier\/\">V\u00e9ronique Cortier<\/a>, and Alexandre Debant<br \/>\nIn the proceedings of: <a href=\"https:\/\/csf2023.ieee-security.org\/\">36th IEEE Computer Security Foundations Symposium (CSF), 2023<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/csf-23\/paper-ccd.pdf\">[pdf]<\/a><\/li>\n<p> <\/p>\n<li>\nProving Unlinkability using ProVerif through Desynchronised Bi-Processes<br \/><a href=\"https:\/\/people.irisa.fr\/David.Baelde\/\">David Baelde<\/a>, Alexandre Debant, and <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/csf2023.ieee-security.org\/\">36th IEEE Computer Security Foundations Symposium (CSF), 2023<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/csf-23\/paper-bdd.pdf\">[pdf]<\/a><\/li>\n<p> <\/p>\n<li>\nReversing, Breaking, and Fixing the French Legislative Election E-Voting Protocol.<br \/>Alexandre Debant, and <a href=\"https:\/\/members.loria.fr\/LHirschi\/\">Lucca Hirschi<\/a><br \/>\n Accepted talk at: <a href=\"https:\/\/rwc.iacr.org\/2023\/\">IACR Real World Crypto (RWC) 2023<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/eprint.iacr.org\/2022\/1653\">[eprint]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/hal.inria.fr\/hal-03875463\">[hal]<\/a><\/li>\n<p> <\/p>\n<li>\nThemis: an on-site voting system with systematic cast-as-intended verification and partial accountability.<br \/>Micka\u00ebl Bougon, Herv\u00e9 Chabanne, <a href=\"https:\/\/members.loria.fr\/VCortier\/\">V\u00e9ronique Cortier<\/a>, Alexandre Debant, Emmanuelle Dottax, <a href=\"https:\/\/members.loria.fr\/JDreier\/\">Jannik Dreier<\/a>, <a href=\"https:\/\/members.loria.fr\/PGaudry\/\">Pierrick Gaudry<\/a>, and Mathieu Turuani<br \/>\nIn the proceedings of: <a href=\"https:\/\/www.sigsac.org\/ccs\/CCS2022\/\">ACM Conference on Computer and Communications Security (CCS) 2022<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/ccs-22\/paper.pdf\">[pdf]<\/a><\/li>\n<p> <\/p>\n<li>\nA privacy attack against the Swiss Post e-voting system.<br \/><a href=\"https:\/\/members.loria.fr\/VCortier\/\">V\u00e9ronique Cortier<\/a>, Alexandre Debant, and <a href=\"https:\/\/members.loria.fr\/PGaudry\/\">Pierrick Gaudry<\/a><br \/>\n Accepted talk at: <a href=\"https:\/\/rwc.iacr.org\/2022\/\">IACR Real World Crypto (RWC) 2022<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/rwc-22\/rwc.pdf\">[pdf]<\/a><\/li>\n<p> <\/p>\n<li>\nSecurity Analysis and Implementation of Relay-Resistant Contacless Payments.<br \/><a href=\"https:\/\/www.surrey.ac.uk\/people\/ioana-boureanu-carlson\">Ioana Boureanu<\/a>, <a href=\"https:\/\/www.cs.bham.ac.uk\/~tpc\/\">Tom Chothia<\/a>, Alexandre Debant, and <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/www.sigsac.org\/ccs\/CCS2020\/\">ACM Conference on Computer and Communications Security (CCS) 2020<\/a><br \/><a href=\"https:\/\/people.irisa.fr\/Alexandre.Debant\/ccs-details.html\">Details<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/ccs-20\/article.pdf\">[pdf]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/ccs-20\/poster.pdf\">[poster]<\/a><\/li>\n<p> <\/p>\n<li>\nSymbolic Analysis of Terrorist Fraud Resistance.<br \/>Alexandre Debant, <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a>, and <a href=\"http:\/\/people.rennes.inria.fr\/Cyrille.Wiedling\/\">Cyrille Wiedling<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/esorics2019.uni.lu\/\">European Symposium on Research in Computer Security (ESORICS) 2019<\/a><br \/><a href=\"https:\/\/people.irisa.fr\/Alexandre.Debant\/proverif-tfr.html\">Details<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/esorics-19\/version-finale.pdf\">[pdf]<\/a><\/li>\n<p> <\/p>\n<li>\nSymbolic Verification of Distance-Bounding Protocols.<br \/>Alexandre Debant, and <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/conf.researchr.org\/track\/etaps-2019\/post-2019-papers\">Principles of Security and Trust (POST) 2019<\/a><br \/><a href=\"https:\/\/people.irisa.fr\/Alexandre.Debant\/akiss-db.html\">Details<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/post-19\/post-19.pdf\">[pdf]<\/a><\/li>\n<p> <\/p>\n<li>\nA Symbolic Framework to Analyse Physical Proximity in Security Protocols.<br \/>Alexandre Debant, <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a>, and <a href=\"http:\/\/people.rennes.inria.fr\/Cyrille.Wiedling\/\">Cyrille Wiedling<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/www.fsttcs.org.in\/\">Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2018<\/a><br \/><a href=\"https:\/\/people.irisa.fr\/Alexandre.Debant\/proving-physical-proximity-using-symbolic-methods.html\">Details<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/fsttcs-18\/fsttcs-18.pdf\">[pdf]<\/a><\/li>\n<p> \n <\/ul>\n<p>\n &nbsp; <\/p>\n<h4> Workshop papers <\/h4>\n<ul>\n<li>\nBeleniosCaI: Belenios with cast as intended.<br \/><a href=\"https:\/\/members.loria.fr\/VCortier\/\">V\u00e9ronique Cortier<\/a>, Alexandre Debant, <a href=\"https:\/\/members.loria.fr\/PGaudry\/\">Pierrick Gaudry<\/a>, and <a href=\"https:\/\/stephane.glondu.net\/\">St\u00e9phane Glondu<\/a><br \/>\n<a href=\"https:\/\/fc23.ifca.ai\/voting\/\">8th Workshop on Advances in Secure Electronic Voting (VOTING), 2023<\/a><br \/><u>Download:<\/u> <a href=\"https:\/\/inria.hal.science\/hal-04020110\">[hal]<\/a><\/li>\n<p> \n <\/ul>\n<p>\n &nbsp; <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Thesis <\/p>\n<ul>\n<li>\nSymbolic verification of distance-bounding protocols &#8211; Application to payment protocols.<br \/>Alexandre Debant<br \/>\nDefended on November 17th, 2020 at IRISA, Rennes, France<br \/>Download: <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/manuscript.pdf\">[manuscript]<\/a>&nbsp;&nbsp;&nbsp;<a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/slides.pdf\">[slides]<\/a><\/li>\n<\/p>\n<\/ul>\n<p>\n &nbsp; <\/p>\n<p> Journal papers<\/p>\n<ul>\n<li>\nSo near and yet so far &#8211; Symbolic verification of distance-bounding protocols.<br \/>Alexandre Debant, <a href=\"https:\/\/people.irisa.fr\/Stephanie.Delaune\/\">St\u00e9phanie Delaune<\/a>, and <a href=\"http:\/\/people.rennes.inria.fr\/Cyrille.Wiedling\/\">Cyrille Wiedling<\/a><br \/>\nIn the proceedings of: <a href=\"https:\/\/dl.acm.org\/journal\/tops\">ACM Transactions on Privacy and Security (TOPS)<\/a> (TISSEC pre 2018)<br \/>Download: <a href=\"https:\/\/members.loria.fr\/ADebant\/files\/papers\/tops-21\/tops-21.pdf\">[pdf]<\/a><\/li>\n<\/p>\n<\/ul>\n<p>\n &nbsp; <\/p>\n<p> Conference papers <\/p>\n<ul>\n<li>\nElection Eligibility with OpenID: Turning Authentication into Transferable Proof of Eligibility.<\/li>\n<\/ul>\n","protected":false},"author":5,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-fullwidth.php","meta":{"footnotes":""},"class_list":["post-13","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/pages\/13","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/comments?post=13"}],"version-history":[{"count":44,"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/pages\/13\/revisions"}],"predecessor-version":[{"id":436,"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/pages\/13\/revisions\/436"}],"wp:attachment":[{"href":"https:\/\/members.loria.fr\/ADebant\/wp-json\/wp\/v2\/media?parent=13"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}