Commitments for the Masses – Making UC Commitments Great Again
PhD defence, Friday, 5 May 2017. Bernardo David.
During his studies, Bernardo David researched efficient constructions homomorphic universally composable (UC) commitment schemes. Universally composable commitment scheme serve as fundmental bulding blocks of many cryptographic protocols, specially when they have homomorphic properties. Bernardo developed a new approach for constructing homomorphic UC commitments that only require a small number of expensive operations as setup and then provide an unlimited number of commitments only using very cheap operations.
The new techniques resulting from this research have shed light on the fundamental limits of UC commitment efficiency while finding applications in other problems, such as two-party computation and oblivious transfer extension.
The PhD degree was completed at the Department of Computer Science, Science and Technology, Aarhus University.
This résumé was prepared by the PhD student.
Time: Friday, 5 May 2017 at 13:00
Place: Building 5335 (NYGAARD), room 295, Department of Computer Science, Finlandsgade 21, Aarhus University, 8200 Aarhus N.
Title of dissertation: A Framework For Efficient Homomorphic Universally Composable Commitments
Contact information: Bernardo David, e-mail: email@example.com, tel: (+45) 29883541
Members of the assessment committee:
Associate professor Alon Rosen, Herzliya Interdisciplinary Center (IDC) Tel Aviv
Research Professor Helger Lipmaa, Department of Computer Science, University of Tartu
Professor Susanne Bødker, Department of Computer Science, Aarhus University (chair)
Professor Ivan Damgård, Department of Computer Science, Aarhus University
Associate Professor Jesper Buus Nielsen, Department of Computer Science, Aarhus University
Language: The PhD dissertation will be defended in English
The defence is public.
The dissertation is available for reading at the Graduate School of Science and Technology/GSST, Ny Munkegade 120, building 1520, rooms 128-134, 8000 Aarhus C.