{"id":368558,"date":"2017-03-02T13:22:29","date_gmt":"2017-03-02T21:22:29","guid":{"rendered":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/?post_type=msr-research-item&#038;p=368558"},"modified":"2018-10-16T21:39:01","modified_gmt":"2018-10-17T04:39:01","slug":"security-free-xor-technique","status":"publish","type":"msr-research-item","link":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/publication\/security-free-xor-technique\/","title":{"rendered":"On the Security of the &#8220;Free-XOR&#8221; Technique"},"content":{"rendered":"<section id=\"Abs1\" class=\"Abstract\" lang=\"en\" tabindex=\"-1\">\n<p class=\"Para\">Yao\u2019s <em class=\"EmphasisTypeItalic \">garbled-circuit approach<\/em> enables constant-round secure two-party computation of any function. In Yao\u2019s original construction, each gate in the circuit requires the parties to perform a constant number of encryptions\/decryptions and to send\/receive a constant number of ciphertexts. Kolesnikov and Schneider (ICALP\u00a02008) proposed an improvement that allows XOR gates to be evaluated \u201cfor free,\u201d incurring no cryptographic operations and zero communication. Their \u201cfree-XOR\u201d technique has proven very popular, and has been shown to improve performance of garbled-circuit protocols by up to a factor of\u00a04.<\/p>\n<p class=\"Para\">Kolesnikov and Schneider proved security of their approach in the random oracle model, and claimed that (an unspecified variant of) correlation robustness suffices; this claim has been repeated in subsequent work, and similar ideas have since been used in other contexts. We show that the free-XOR technique <em class=\"EmphasisTypeItalic \">cannot<\/em> be proven secure based on correlation robustness alone; somewhat surprisingly, some form of <em class=\"EmphasisTypeItalic \">circular security<\/em> is also required. We propose an appropriate definition of security for hash functions capturing the necessary requirements, and prove security of the free-XOR approach when instantiated with any hash function satisfying our definition.<\/p>\n<p class=\"Para\">Our results do not impact the security of the free-XOR technique in practice, or imply an error in the free-XOR work, but instead pin down the assumptions needed to prove security.<\/p>\n<\/section>\n<div class=\"HeaderArticleNotes\">\n<aside class=\"ArticleNote ArticleNoteMisc\">\n<p class=\"SimplePara\">This work was supported in part by NSF awards\u00a0#0447075 and\u00a0#1111599, and by DARPA.<\/p>\n<\/aside>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Yao\u2019s garbled-circuit approach enables constant-round secure two-party computation of any function. In Yao\u2019s original construction, each gate in the circuit requires the parties to perform a constant number of encryptions\/decryptions and to send\/receive a constant number of ciphertexts. Kolesnikov and Schneider (ICALP\u00a02008) proposed an improvement that allows XOR gates to be evaluated \u201cfor free,\u201d incurring [&hellip;]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":null,"msr_publishername":"Springer, Berlin, Heidelberg","msr_publisher_other":"","msr_booktitle":"","msr_chapter":"","msr_edition":"","msr_editors":"","msr_how_published":"","msr_isbn":"","msr_issue":"","msr_journal":"","msr_number":"","msr_organization":"","msr_pages_string":"39-53","msr_page_range_start":"39","msr_page_range_end":"53","msr_series":"","msr_volume":"7194","msr_copyright":"","msr_conference_name":"TCC 2012: Theory of Cryptography","msr_doi":"10.1007\/978-3-642-28914-9_3","msr_arxiv_id":"","msr_s2_paper_id":"","msr_mag_id":"","msr_pubmed_id":"","msr_other_authors":"","msr_other_contributors":"","msr_speaker":"","msr_award":"","msr_affiliation":"","msr_institution":"","msr_host":"","msr_version":"","msr_duration":"","msr_original_fields_of_study":"","msr_release_tracker_id":"","msr_s2_match_type":"","msr_citation_count_updated":"","msr_published_date":"2012-03-19","msr_highlight_text":"","msr_notes":"","msr_longbiography":"","msr_publicationurl":"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-28914-9_3","msr_external_url":"","msr_secondary_video_url":"","msr_conference_url":"","msr_journal_url":"","msr_s2_pdf_url":"","msr_year":0,"msr_citation_count":0,"msr_influential_citations":0,"msr_reference_count":0,"msr_s2_match_confidence":0,"msr_microsoftintellectualproperty":true,"msr_s2_open_access":false,"msr_s2_author_ids":[],"msr_pub_ids":[],"msr_hide_image_in_river":0,"footnotes":""},"msr-research-highlight":[],"research-area":[13561,13558],"msr-publication-type":[193716],"msr-publisher":[],"msr-focus-area":[],"msr-locale":[268875],"msr-post-option":[],"msr-field-of-study":[],"msr-conference":[],"msr-journal":[],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-368558","msr-research-item","type-msr-research-item","status-publish","hentry","msr-research-area-algorithms","msr-research-area-security-privacy-cryptography","msr-locale-en_us"],"msr_publishername":"Springer, Berlin, Heidelberg","msr_edition":"","msr_affiliation":"","msr_published_date":"2012-03-19","msr_host":"","msr_duration":"","msr_version":"","msr_speaker":"","msr_other_contributors":"","msr_booktitle":"","msr_pages_string":"39-53","msr_chapter":"","msr_isbn":"","msr_journal":"","msr_volume":"7194","msr_number":"","msr_editors":"","msr_series":"","msr_issue":"","msr_organization":"","msr_how_published":"","msr_notes":"","msr_highlight_text":"","msr_release_tracker_id":"","msr_original_fields_of_study":"","msr_download_urls":"","msr_external_url":"","msr_secondary_video_url":"","msr_longbiography":"","msr_microsoftintellectualproperty":1,"msr_main_download":"368864","msr_publicationurl":"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-28914-9_3","msr_doi":"10.1007\/978-3-642-28914-9_3","msr_publication_uploader":[{"type":"file","title":"71940123","viewUrl":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-content\/uploads\/2017\/03\/71940123.pdf","id":368864,"label_id":0},{"type":"url","title":"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-28914-9_3","viewUrl":false,"id":false,"label_id":0},{"type":"doi","title":"10.1007\/978-3-642-28914-9_3","viewUrl":false,"id":false,"label_id":0}],"msr_related_uploader":"","msr_citation_count":0,"msr_citation_count_updated":"","msr_s2_paper_id":"","msr_influential_citations":0,"msr_reference_count":0,"msr_arxiv_id":"","msr_s2_author_ids":[],"msr_s2_open_access":false,"msr_s2_pdf_url":null,"msr_attachments":[{"id":0,"url":"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-28914-9_3"}],"msr-author-ordering":[{"type":"text","value":"Seung Geol Choi","user_id":0,"rest_url":false},{"type":"text","value":"Jonathan Katz","user_id":0,"rest_url":false},{"type":"user_nicename","value":"rakumare","user_id":36197,"rest_url":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=rakumare"},{"type":"text","value":"Hong-Sheng Zhou","user_id":0,"rest_url":false}],"msr_impact_theme":[],"msr_research_lab":[],"msr_event":[],"msr_group":[],"msr_project":[],"publication":[],"video":[],"msr-tool":[],"msr_publication_type":"inproceedings","related_content":[],"_links":{"self":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/368558","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item"}],"about":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-research-item"}],"version-history":[{"count":2,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/368558\/revisions"}],"predecessor-version":[{"id":537729,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/368558\/revisions\/537729"}],"wp:attachment":[{"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/media?parent=368558"}],"wp:term":[{"taxonomy":"msr-research-highlight","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-research-highlight?post=368558"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=368558"},{"taxonomy":"msr-publication-type","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-publication-type?post=368558"},{"taxonomy":"msr-publisher","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-publisher?post=368558"},{"taxonomy":"msr-focus-area","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-focus-area?post=368558"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=368558"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=368558"},{"taxonomy":"msr-field-of-study","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-field-of-study?post=368558"},{"taxonomy":"msr-conference","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-conference?post=368558"},{"taxonomy":"msr-journal","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-journal?post=368558"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=368558"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/cm-edgetun.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=368558"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}