{"57744":{"#nid":"57744","#data":{"type":"news","title":"\u2018Bonsai\u2019 Best Paper for Peikert","body":[{"value":"\u003Cp\u003E\u003Ca href=\u0022http:\/\/www.scs.gatech.edu\/people\/chris-peikert\u0022\u003EPeikert\u003C\/a\u003E, an assistant professor in the School of \nComputer Science,\nearned the honor for \u201cBonsai Trees, or How to Delegate a Lattice Basis,\u201d\nwhich he presented during \u003Ca href=\u0022http:\/\/crypto.rd.francetelecom.com\/events\/eurocrypt2010\/\u0022 target=\u0022_blank\u0022\u003EEurocrypt 2010\u003C\/a\u003E,\none of the premier international conferences of cryptography, held May \n30-June\n3 in Monaco and Nice, France. Peikert said lattice-based cryptography is\n a\nrelatively new kind that has the promise of high efficiency, \nparallelism, and--unlike\nessentially all other standard crypto--resistance to attacks by quantum\ncomputers.\u003C\/p\u003E\n\n\n\n\u003Cp\u003E\u201cWe dealt with one of the main outstanding problems\n in\nthe area,\u201d Peikert said. \u201cPrevious designs for \u2018digital\nsignatures\u2019 and \u2018identity-based encryption\u2019 were simple and\nefficient, but their security analysis relied on a not-entirely-sound \nshortcut\ncalled a \u2018random oracle.\u2019 The main question was whether this\nshortcut could be removed (and without hurting efficiency too much), \nthereby\nmaking the schemes rest on a much more rigorous foundation. The paper \nsolves\nexactly this problem\u2014and, as a bonus side-effect, the techniques also\nmake it possible to design what\u0027s called a hierarchical ID-based \nencryption\nscheme, which is a more flexible structure that can better distribute \ntrust and\nwithstand unintended exposures of secret keys.\u201d\u003C\/p\u003E\n\n\n\n\u003Cp\u003EPeikert\u2019s co-authors were recently graduated \nGeorgia\nTech Ph.D. student David Cash (now a postdoctoral researcher at \nUniversity of\nCalifornia, San Diego), as well as Dennis Hofheinz and Eike Kiltz of CWI\n (\u003Cem\u003ECentrum\nWiskunde \u0026amp; Informatica\u003C\/em\u003E) in Amsterdam. The full text of their \npaper is\navailable \u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/%7Ecpeikert\/pubs\/bonsai.pdf\u0022 target=\u0022_blank\u0022\u003Ehere\u003C\/a\u003E.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EChris Peikert (CS) won a Best Paper award at \nEurocrypt 2010\nfor a paper in his specialty area of lattice-based cryptography. (\u003Cem\u003ESource:\nOffice\n of Communications\u003C\/em\u003E)\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":"","uid":"27372","created_gmt":"2010-06-02 12:43:31","changed_gmt":"2016-10-08 03:06:39","author":"Matt Goforth","boilerplate_text":"","field_publication":"","field_article_url":"","dateline":{"date":"2010-06-02T00:00:00-04:00","iso_date":"2010-06-02T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}