Three useful threshold cryptography problems with efficient solutions

Abstract

First and foremost, I thank my advisor, abhi shelat, who introduced me to the field of cryptography and with whom I have subsequently worked for eight years. I never considered to pursue a PhD before I met him, and only through the guidance, opportunities, funding, and freedom he provided have I now attained one. His support has been unwavering.I thank my coauthors, who contributed directly to the constituent works of this thesis: Megan Chen, Ran Cohen, Yashvanth Kondi, Eysa Lee, and Schuyler Rosefield. For the innumerable things they taught me and the errors they corrected, and the many late nights and early mornings that we shared; for our meals and our discusssions and our travels together; for our rejections, and our eventual successes, and our unrealized ambitions, I am deeply grateful.I thank my thesis committee: Yuval Ishai, Jonathan Ullman, and Daniel Wichs. This thesis represents a small part of the work I have done and the experiences I have had as a graduate student, and these direct contributors are a few among the many who have helped me on my way.I thank David Evans, who found me at a criticial juncture in my life and set me on the path to a PhD. I thank the members of the greater Northeastern Crypto and Privacy Group, with whom that path was shared: Konstantina