{"418881":{"#nid":"418881","#data":{"type":"event","title":"PhD Defense by Abhishek Banerjee","body":[{"value":"\u003Cp\u003ETitle :\u0026nbsp;New Constructions of Cryptographic Pseudorandom Functions\u003C\/p\u003E\u003Cp\u003EAbhishek Banerjee\u003Cbr \/\u003E PhD Candidate in Algorithms, Combinatorics, and Optimization\u003Cbr \/\u003E School of Computer Science\u003Cbr \/\u003E Georgia Institute of Technology\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022mailto:abhishek.banerjee@cc.gatech.edu\u0022 target=\u0022_blank\u0022\u003Eabhishek.banerjee@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022http:\/\/www.cc.gatech.edu\/~abanerje\/\u0022 target=\u0022_blank\u0022\u003Ehttp:\/\/www.cc.gatech.edu\/~abanerje\/\u003C\/a\u003E\u003C\/p\u003E\u003Cp\u003EDate:\u0026nbsp;Monday, June 29th\u003Cbr \/\u003E Time:\u0026nbsp;11:00am\u003Cbr \/\u003E Location: Klaus 2100\u003C\/p\u003E\u003Cp\u003E\u003Cbr \/\u003E Committee:\u003C\/p\u003E\u003Cp\u003EDr. Chris Peikert, School of Computer Science (Advisor)\u003C\/p\u003E\u003Cp\u003EDr. Alexandra Boldyreva, School of Computer Science\u003C\/p\u003E\u003Cp\u003EDr. Santanu Dey, School of Industrial and Systems Engineering\u003C\/p\u003E\u003Cp\u003EDr. Lance Fortnow, School of Computer Science\u003C\/p\u003E\u003Cp\u003EDr. Richard Lipton, School of Computer Science\u003C\/p\u003E\u003Cp\u003EDr. Alon Rosen, IDC Herzliya\u003Cbr \/\u003E \u003Cbr \/\u003E Abstract:\u003Cbr \/\u003E Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all central goals of symmetric cryptography (e.g., encryption, authentication, identification) have simple solutions that make efficient use of a PRF. Most existing constructions of these objects are either (a) extremely fast in practice but without provable security guarantees based on hard mathematical problems [AES, Blowfish etc.], or (b) provably secure under assumptions like the hardness of factoring, but extremely inefficient in practice.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003ELattice-based constructions enjoy strong security guarantees based on natural mathematical problems, are asymptotically and practically efficient, and have thus far even withstood attacks by quantum algorithms. However, most recent lattice-based constructions are of public-key objects, and it\u0027s natural to ask whether these advantages can be brought to the world of symmetric-key constructions.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003EIn this thesis, we construct asymptotically fast and parallel pseudorandom functions basing their security on a well known hard lattice problem called the learning with errors problem. We provide several types of constructions that have their respective efficiency and security advantages. In addition to this, we also provide improved constructions of key-homomorphic PRFs that achieve almost optimal quasi-linear magnitudes of public parameters, key sizes and incremental run times. We also propose a new cryptographic primitive, constrained key-homomorphic PRFs, provide secure candidate constructions and applications. Lastly, we detail an implementation in software of a candidate PRF and analyze its efficiency and security.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"New Constructions of Cryptographic Pseudorandom Functions"}],"uid":"27707","created_gmt":"2015-06-26 11:32:41","changed_gmt":"2016-10-08 02:12:22","author":"Tatianna Richardson","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2015-06-29T12:00:00-04:00","event_time_end":"2015-06-29T14:00:00-04:00","event_time_end_last":"2015-06-29T14:00:00-04:00","gmt_time_start":"2015-06-29 16:00:00","gmt_time_end":"2015-06-29 18:00:00","gmt_time_end_last":"2015-06-29 18:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"221981","name":"Graduate Studies"}],"categories":[],"keywords":[{"id":"4970","name":"aco"},{"id":"1366","name":"defense"},{"id":"100811","name":"Phd Defense"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1788","name":"Other\/Miscellaneous"}],"invited_audience":[{"id":"78771","name":"Public"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}