

{"id":225,"date":"2012-12-10T17:20:26","date_gmt":"2012-12-10T16:20:26","guid":{"rendered":"https:\/\/project.inria.fr\/quail\/?page_id=225"},"modified":"2013-01-15T16:50:03","modified_gmt":"2013-01-15T15:50:03","slug":"bit-xor","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/quail\/bit-xor\/","title":{"rendered":"Bit XOR"},"content":{"rendered":"<p><\/p>\n<p style=\"text-align: justify;\"><div class=\"alert alert-success\" role=\"alert\"><p class=\"printonly\"><strong>Important!<\/strong><\/p>Download and extract the\u00a0<a href=\"https:\/\/project.inria.fr\/quail\/files\/2013\/01\/bit_xor.zip\">bit_xor.zip<\/a> program.<\/div><\/p>\n<p style=\"text-align: justify;\">In this simple example we consider a 1-bit secret h. The protocol produces a random bit r with a given probability p of being 1, and outputs the result of the exclusive disjunction operation between h and r. The attacker knows p and can observe the output, but not r or h. Basically he knows p and whether h = r or not. If p = 0:5 the attacker cannot infer any information about h, thus we have noninterference, i.e. the leakage is 0 bits. If p = 0 or p = 1 then the attacker can determine precisely the value of h, and thus the leakage is 1 bit.<\/p>\n<p style=\"text-align: justify;\">QUAIL can quantify the leakage with arbitrary precision for all p between 0 and\u0014 1. The results are shown in the graph below.<\/p>\n<p><a href=\"https:\/\/project.inria.fr\/quail\/files\/2012\/12\/bit_xor.png\"><img loading=\"lazy\" decoding=\"async\" class=\" wp-image-226 aligncenter\" title=\"bit_xor\" src=\"https:\/\/project.inria.fr\/quail\/files\/2012\/12\/bit_xor.png\" alt=\"\" width=\"282\" height=\"191\" \/><\/a><\/p>","protected":false},"excerpt":{"rendered":"<p>In this simple example we consider a 1-bit secret h. The protocol produces a random bit r with a given probability p of being 1, and outputs the result of the exclusive disjunction operation between h and r. The attacker knows p and can observe the output, but not r or h. Basically he knows &hellip; <\/p>\n<p><a class=\"more-link btn\" href=\"https:\/\/project.inria.fr\/quail\/bit-xor\/\">Continue reading<\/a><\/p>\n","protected":false},"author":235,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-225","page","type-page","status-publish","hentry","nodate","item-wrap"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/pages\/225","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/users\/235"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/comments?post=225"}],"version-history":[{"count":5,"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/pages\/225\/revisions"}],"predecessor-version":[{"id":362,"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/pages\/225\/revisions\/362"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/quail\/wp-json\/wp\/v2\/media?parent=225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}