{"id":548802,"date":"2018-11-07T14:38:06","date_gmt":"2018-11-07T22:38:06","guid":{"rendered":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/?post_type=msr-research-item&#038;p=548802"},"modified":"2020-12-17T11:47:27","modified_gmt":"2020-12-17T19:47:27","slug":"2-server-pir-with-sub-polynomial-communication","status":"publish","type":"msr-research-item","link":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/publication\/2-server-pir-with-sub-polynomial-communication\/","title":{"rendered":"2-Server PIR with sub-polynomial communication"},"content":{"rendered":"<p><span style=\"color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff;float: none\">A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the\u00a0<\/span><span class=\"MathJax_Preview\" style=\"color: #888888;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff\">i<\/span><span style=\"color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff;float: none\">th bit of an\u00a0<\/span><span class=\"MathJax_Preview\" style=\"color: #888888;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff\">n<\/span><span style=\"color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff;float: none\">-bit database replicated among two servers (which do not communicate) while not revealing any information about\u00a0<\/span><span class=\"MathJax_Preview\" style=\"color: #888888;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff\">i<\/span><span style=\"color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff;float: none\">\u00a0to either server. In this work we construct a 1-round 2-server PIR with total communication cost\u00a0<\/span><span class=\"MathJax_Preview\" style=\"color: #888888;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff\">n^{O({\\sqrt{\\log\\log n\/\\log n}})}<\/span><span id=\"MathJax-Element-4-Frame\" class=\"MathJax MathJax_Processing\" style=\"font-style: normal;font-weight: 400;line-height: normal;font-size: 14.4px;text-indent: 0px;text-align: left;letter-spacing: normal;float: none;direction: ltr;max-width: none;max-height: none;min-width: 0px;min-height: 0px;border: 0px;padding: 0px;margin: 0px;width: 0px;height: 0px;overflow: hidden;color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;background-color: #ffffff\"><\/span><span style=\"color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff;float: none\">. This improves over the currently known 2-server protocols which require\u00a0<\/span><span class=\"MathJax_Preview\" style=\"color: #888888;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff\">O(n^{1\/3})\u00a0<\/span><span id=\"MathJax-Element-5-Frame\" class=\"MathJax MathJax_Processing\" style=\"font-style: normal;font-weight: 400;line-height: normal;font-size: 14.4px;text-indent: 0px;text-align: left;letter-spacing: normal;float: none;direction: ltr;max-width: none;max-height: none;min-width: 0px;min-height: 0px;border: 0px;padding: 0px;margin: 0px;width: 0px;height: 0px;overflow: hidden;color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;background-color: #ffffff\"><\/span><span style=\"color: #000000;font-family: 'Lucida Grande', helvetica, arial, verdana, sans-serif;font-size: 14.4px;font-style: normal;font-weight: 400;letter-spacing: normal;text-align: start;text-indent: 0px;background-color: #ffffff;float: none\">communication and matches the communication cost of known 3-server PIR schemes. Our improvement comes from reducing the number of servers in existing protocols, based on Matching Vector Codes, from 3 or 4 servers to 2. This is achieved by viewing these protocols in an algebraic way (using polynomial interpolation) and extending them using partial derivatives.<\/span><\/p>\n<p><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/www.youtube.com\/watch?v=mL9iNGH2vVA\">Talk at DIMACS workshop (Rutgers University)<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/www.youtube.com\/watch?v=iXBncrIlMco\">Zeev&#8217;s TCS+ talk<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the\u00a0ith bit of an\u00a0n-bit database replicated among two servers (which do not communicate) while not revealing any information about\u00a0i\u00a0to either server. In this work we construct a 1-round 2-server PIR with total communication cost\u00a0n^{O({\\sqrt{\\log\\log n\/\\log n}})}. This improves over the currently known 2-server [&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":"","msr_publisher_other":"","msr_booktitle":"","msr_chapter":"","msr_edition":"","msr_editors":"","msr_how_published":"","msr_isbn":"","msr_issue":"4","msr_journal":"Journal of the ACM (JACM)","msr_number":"","msr_organization":"","msr_pages_string":"","msr_page_range_start":"","msr_page_range_end":"","msr_series":"","msr_volume":"63","msr_copyright":"","msr_conference_name":"","msr_doi":"","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":"2016-11-1","msr_highlight_text":"Best Paper Award in STOC 2015","msr_notes":"Conference version appeared in STOC 2015 where it was a cowinner of the best paper award.","msr_longbiography":"","msr_publicationurl":"","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":false,"msr_s2_open_access":false,"msr_s2_author_ids":[],"msr_pub_ids":[],"msr_hide_image_in_river":0,"footnotes":""},"msr-research-highlight":[246574],"research-area":[13546,13558],"msr-publication-type":[193715],"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-548802","msr-research-item","type-msr-research-item","status-publish","hentry","msr-research-highlight-award","msr-research-area-computational-sciences-mathematics","msr-research-area-security-privacy-cryptography","msr-locale-en_us"],"msr_publishername":"","msr_edition":"","msr_affiliation":"","msr_published_date":"2016-11-1","msr_host":"","msr_duration":"","msr_version":"","msr_speaker":"","msr_other_contributors":"","msr_booktitle":"","msr_pages_string":"","msr_chapter":"","msr_isbn":"","msr_journal":"Journal of the ACM (JACM)","msr_volume":"63","msr_number":"","msr_editors":"","msr_series":"","msr_issue":"4","msr_organization":"","msr_how_published":"","msr_notes":"Conference version appeared in STOC 2015 where it was a cowinner of the best paper award.","msr_highlight_text":"Best Paper Award in STOC 2015","msr_release_tracker_id":"","msr_original_fields_of_study":"","msr_download_urls":"","msr_external_url":"","msr_secondary_video_url":"","msr_longbiography":"","msr_microsoftintellectualproperty":0,"msr_main_download":"","msr_publicationurl":"","msr_doi":"","msr_publication_uploader":[{"type":"doi","viewUrl":"false","id":"false","title":"10.1145\/2968443","label_id":"243109","label":0},{"type":"url","viewUrl":"false","id":"false","title":"https:\/\/eccc.weizmann.ac.il\/report\/2014\/094\/","label_id":"243103","label":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":[],"msr-author-ordering":[{"type":"text","value":"Zeev Dvir","user_id":0,"rest_url":false},{"type":"user_nicename","value":"Sivakanth Gopi","user_id":37830,"rest_url":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=Sivakanth Gopi"}],"msr_impact_theme":[],"msr_research_lab":[],"msr_event":[],"msr_group":[],"msr_project":[],"publication":[],"video":[],"msr-tool":[],"msr_publication_type":"article","related_content":[],"_links":{"self":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/548802","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item"}],"about":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-research-item"}],"version-history":[{"count":3,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/548802\/revisions"}],"predecessor-version":[{"id":548838,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/548802\/revisions\/548838"}],"wp:attachment":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/media?parent=548802"}],"wp:term":[{"taxonomy":"msr-research-highlight","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-highlight?post=548802"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=548802"},{"taxonomy":"msr-publication-type","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-publication-type?post=548802"},{"taxonomy":"msr-publisher","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-publisher?post=548802"},{"taxonomy":"msr-focus-area","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-focus-area?post=548802"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=548802"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=548802"},{"taxonomy":"msr-field-of-study","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-field-of-study?post=548802"},{"taxonomy":"msr-conference","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-conference?post=548802"},{"taxonomy":"msr-journal","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-journal?post=548802"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=548802"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=548802"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}