{"id":81,"date":"2017-04-18T15:05:48","date_gmt":"2017-04-18T13:05:48","guid":{"rendered":"https:\/\/project.inria.fr\/hyleak\/?page_id=81"},"modified":"2017-04-18T18:07:33","modified_gmt":"2017-04-18T16:07:33","slug":"shifting-window","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/hyleak\/shifting-window\/","title":{"rendered":"Shifting window"},"content":{"rendered":"

In the shifting window example from Kawamoto et al.<\/a>\u00a0 the secret can take N possible values, and an interval (called a “window”) in the secret domain is randomly selected from 1 to W.
\nIf the value of the secret is inside the window, then another window is randomly chosen in a similar way and the program outputs a random value from this second window.
\nOtherwise, the program outputs a random value over the secret domain. The input code is as follows:
\n
\nconst N:=16;
\nconst W:=14;
\nsecret int32 sec := [0,N-1];
\npublic int32 minS;
\npublic int32 sizeS;
\nobservable int32 obs;
\npublic int32 minO;
\npublic int32 sizeO;
\nrandom minS := random(0,N-W-1);
\nif (sec>=minS) then
\nrandom sizeS := random(1,W);
\nif (sec<=(minS+sizeS)) then
\nrandom minO := random(0,N-W-1);
\nrandom sizeO := random(1,W);
\nrandom obs := random(minO,minO+sizeO);
\nelse
\nrandom obs := random(0,N-1);
\nfi
\nelse
\nrandom obs := random(0,N-1);
\nfi
\nreturn;
\n<\/code>
\nIn the figures below we present the results of experiments on the shifting window when increasing the size of the secret domain. The execution time of precise analysis grows proportionally to the secret domain size N while HyLeak and fully statistical analysis do not require much time for a larger N. However, in the fully statistical analysis the error from the true value grows rapidly while in using HyLeak the error is much smaller.<\/p>\n

\"\"<\/a> \"\"<\/a><\/p>","protected":false},"excerpt":{"rendered":"

In the shifting window example from Kawamoto et al.\u00a0 the secret can take N possible values, and an interval (called a “window”) in the secret domain is randomly selected from 1 to W. If the value of the secret is inside the window, then another window is randomly chosen in\u2026<\/p>\n

Continue reading<\/span><\/i><\/a> <\/p>\n","protected":false},"author":534,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-81","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/pages\/81","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/users\/534"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/comments?post=81"}],"version-history":[{"count":3,"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/pages\/81\/revisions"}],"predecessor-version":[{"id":147,"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/pages\/81\/revisions\/147"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/hyleak\/wp-json\/wp\/v2\/media?parent=81"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}