SELECTED ICONIC CHAMBER MUSIC WORKS WITH PIANO FROM THE NINETEENTH AND TWENTIETH CENTURIES

Chamber music repertoire featuring the piano blossomed from the mid-nineteenth through the early twentieth century. The quantity of works increased greatly during this time and the quality of these works reached the highest level. Among the many symbolic works that were composed were sonatas for a single string instrument with piano, piano trios, quartets: and quintets as well as two-piano works and four-hand duets. Being able to study and perform many of these iconic works before I graduated was one of the major goals I set for myself as a collaborative pianist. The abundance of repertoire has made it easy to choose works considered "iconic" for my dissertation's three recitals. Iconic is defined as "very famous or popular, especially being considered to represent particular opinions or a particular time" in the online Cambridge Advanced Leamer's Dictionary & Thesaurus © Cambridge University. The compositions featured in the recitals were composed from 1842 through 1941, including works by Schumann, Brahms, Faure, Rachmaninoff, Ravel, and Lutoslawski. Choosing the repertoire with my fellow performers in mind was an important part of this dissertation. In addition to trying to make balanced programs which include variety, working with different instruments and performers is one of the most fulfilling parts of the musical experience for me as a collaborative pianist. Joining me for the concerts were members of the Aeolus String Quartet (violinist Nicholas Tavani, violinist Rachel Shapiro, violist Greg Luce, and cellist Alan Richardson), pianist Hsiao-Ying Lin (a doctoral student from the Peabody Conservatory), and my colleagues from the Peabody Institute Preparatory Division (faculty violinist Dr. Christian Tremblay and cellist Alicia Ward), and Derek Smith, Associate Principal violist of the Annapolis Symphony Orchestras). The three recitals were performed in the Gildenhom and Ulrich Recital Halls at the University of Maryland, College Park, Maryland. They are recorded on CD and available on compact discs, which can be found in the Digital Repository at the University of Maryland (DRUM).

Provable Security for Cryptocurrencies

The past several years have seen the surprising and rapid rise of Bitcoin and other “cryptocurrencies.” These are decentralized peer-to-peer networks that allow users to transmit money, tocompose financial instruments, and to enforce contracts between mutually distrusting peers, andthat show great promise as a foundation for financial infrastructure that is more robust, efficientand equitable than ours today. However, it is difficult to reason about the security of cryptocurrencies. Bitcoin is a complex system, comprising many intricate and subtly-interacting protocol layers. At each layer it features design innovations that (prior to our work) have not undergone any rigorous analysis. Compounding the challenge, Bitcoin is but one of hundreds of competing cryptocurrencies in an ecosystem that is constantly evolving. The goal of this thesis is to formally reason about the security of cryptocurrencies, reining in their complexity, and providing well-defined and justified statements of their guarantees. We provide a formal specification and construction for each layer of an abstract cryptocurrency protocol, and prove that our constructions satisfy their specifications. The contributions of this thesis are centered around two new abstractions: “scratch-off puzzles,” and the “blockchain functionality” model. Scratch-off puzzles are a generalization of the Bitcoin “mining” algorithm, its most iconic and novel design feature. We show how to provide secure upgrades to a cryptocurrency by instantiating the protocol with alternative puzzle schemes. We construct secure puzzles that address important and well-known challenges facing Bitcoin today, including wasted energy and dangerous coalitions. The blockchain functionality is a general-purpose model of a cryptocurrency rooted in the “Universal Composability” cryptography theory. We use this model to express a wide range of applications, including transparent “smart contracts” (like those featured in Bitcoin and Ethereum), and also privacy-preserving applications like sealed-bid auctions. We also construct a new protocol compiler, called Hawk, which translates user-provided specifications into privacy-preserving protocols based on zero-knowledge proofs.