IRANIAN EMBASSY AND AYANDEH CULTURAL CENTER ( EMBASSY OF THE FUTURE)

This thesis began with the assertion that future embassies will differ significantly from past and current embassies. Embassy of the Future is a place where people of two (or more) countries come together to learn and share their ideologies, perspectives, dictions and ultimately their humanity. Unlike the traditional embassy model where the focus is on representing the foreign country’s political and legal standing, this thesis asserts that future embassies will focus on representing cultural exchanges while promoting economic and cultural cooperation. In this new embassy model political and security matters should not dominate the cultural and humanitarian matters. This thesis is exploring a proposal for the establishment of an Iranian Embassy in Washington D.C. The goal is to promote the Embassy of the Future concept through an attempt at utilizing an architectural structure to be the convening place for reconnecting and resolving conflicts between Iran and the U.S. It has been 36 years since both countries closed their embassies in one another’s countries.

Ledroit Park, A Portrait In Black And White: A Study Of Historic Districts, Social Change, And The Process Of Neighborhood Placemaking

This research examines the process of placemaking in LeDroit Park, a residential Washington, DC, neighborhood with a historic district at its core. Unpacking the entwined physical and social evolution of the small community within the context of the Nation’s Capital, this analysis provides insight into the role of urban design and development as well as historic designation on shaping collective identity. Initially planned and designed in 1873 as a gated suburb just beyond the formal L’Enfant-designed city boundary, LeDroit Park was intended as a retreat for middle and upper-class European Americans from the growing density and social diversity of the city. With a mixture of large romantic revival mansions and smaller frame cottages set on grassy plots evocative of an idealized rural village, the physical design was intentionally inwardly-focused. This feeling of refuge was underscored with a physical fence that surrounded the development, intended to prevent African Americans from nearby Howard University and the surrounding neighborhood, from using the community’s private streets to access the City of Washington. Within two decades of its founding, LeDroit Park was incorporated into the District of Columbia, the surrounding fence was demolished, and the neighborhood was racially integrated. Due to increasingly stringent segregation laws and customs in the city, this period of integration lasted less than twenty years, and LeDroit Park developed into an elite African American enclave, using the urban design as a bulwark against the indignities of a segregated city. Throughout the 20th century housing infill and construction increased density, yet the neighborhood never lost the feeling of security derived from the neighborhood plan. Highlighting the architecture and street design, neighbors successfully received historic district designation in 1974 in order to halt campus expansion. After a stalemate that lasted two decades, the neighborhood began another period of transformation, both racial and socio-economic, catalyzed by a multi-pronged investment program led by Howard University. Through interviews with long-term and new community members, this investigation asserts that the 140-year development history, including recent physical interventions, is integral to placemaking, shaping the material character as well as the social identity of residents.

HOLDING HANDS WHILE PARTING WAYS: EXAMINING ALLIANCE TREATY RENEGOTIATION

This study investigates the renegotiation of security alliances, specifically the structural conditions surrounding their revision. Although the field of international relations offers a rich discussion of the formation and violation of alliance treaties, few scholars have addressed the reasons why alliance members amend security obligations. After the formation of an alliance, a member may become dissatisfied owing to changes in the external and domestic security environments. A failure to address this discontent increases the risk of alliance breakdown. Members manage their alliance relationship through a negotiation process or intra-alliance bargaining in the search for a new arrangement that can endure. Factors that help to show commitment to the alliance and communicate a set of feasible solutions are crucial if members are to find a mutually acceptable arrangement. By taking these factors into account, allies are more likely to revise an existing treaty. Examining a set of bilateral alliances dating from 1945 to 2001, this research demonstrates that public requests for renegotiation compel allies to change the status quo. It is found that alliance-related fixed assets and the formation of external alliances increase the likelihood of treaty revision, though institutionalization of an alliance does not help to resolve interest divergence. In addition, this study examines the strategy of delay in intra-alliance bargaining. Allies may postpone a dispute by ignoring it while working to maintain the alliance. Tension among allies thus increases, but the alliance endures. I examine three alliances in order to illustrate this renegotiation process. Among these, the Anglo-Japanese alliance demonstrates two successful renegotiations that prolonged a wavering alliance relationship; the Sino-Soviet alliance is an example of failure owing to the lack of substantive cooperation; and the US-Taiwan alliance during the 1970s demonstrates successful use of a strategy of delay that appeases a dissatisfied member.

Efficient Secure Computation for Real-world Settings and Security Models

Secure computation involves multiple parties computing a common function while keeping their inputs private, and is a growing field of cryptography due to its potential for maintaining privacy guarantees in real-world applications. However, current secure computation protocols are not yet efficient enough to be used in practice. We argue that this is due to much of the research effort being focused on generality rather than specificity. Namely, current research tends to focus on constructing and improving protocols for the strongest notions of security or for an arbitrary number of parties. However, in real-world deployments, these security notions are often too strong, or the number of parties running a protocol would be smaller. In this thesis we make several steps towards bridging the efficiency gap of secure computation by focusing on constructing efficient protocols for specific real-world settings and security models. In particular, we make the following four contributions: - We show an efficient (when amortized over multiple runs) maliciously secure two-party secure computation (2PC) protocol in the multiple-execution setting, where the same function is computed multiple times by the same pair of parties. - We improve the efficiency of 2PC protocols in the publicly verifiable covert security model, where a party can cheat with some probability but if it gets caught then the honest party obtains a certificate proving that the given party cheated. - We show how to optimize existing 2PC protocols when the function to be computed includes predicate checks on its inputs. - We demonstrate an efficient maliciously secure protocol in the three-party setting.

Language-based Techniques for Practical and Trustworthy Secure Multi-party Computations

Secure Multi-party Computation (MPC) enables a set of parties to collaboratively compute, using cryptographic protocols, a function over their private data in a way that the participants do not see each other's data, they only see the final output. Typical MPC examples include statistical computations over joint private data, private set intersection, and auctions. While these applications are examples of monolithic MPC, richer MPC applications move between "normal" (i.e., per-party local) and "secure" (i.e., joint, multi-party secure) modes repeatedly, resulting overall in mixed-mode computations. For example, we might use MPC to implement the role of the dealer in a game of mental poker -- the game will be divided into rounds of local decision-making (e.g. bidding) and joint interaction (e.g. dealing). Mixed-mode computations are also used to improve performance over monolithic secure computations. Starting with the Fairplay project, several MPC frameworks have been proposed in the last decade to help programmers write MPC applications in a high-level language, while the toolchain manages the low-level details. However, these frameworks are either not expressive enough to allow writing mixed-mode applications or lack formal specification, and reasoning capabilities, thereby diminishing the parties' trust in such tools, and the programs written using them. Furthermore, none of the frameworks provides a verified toolchain to run the MPC programs, leaving the potential of security holes that can compromise the privacy of parties' data. This dissertation presents language-based techniques to make MPC more practical and trustworthy. First, it presents the design and implementation of a new MPC Domain Specific Language, called Wysteria, for writing rich mixed-mode MPC applications. Wysteria provides several benefits over previous languages, including a conceptual single thread of control, generic support for more than two parties, high-level abstractions for secret shares, and a fully formalized type system and operational semantics. Using Wysteria, we have implemented several MPC applications, including, for the first time, a card dealing application. The dissertation next presents Wys*, an embedding of Wysteria in F*, a full-featured verification oriented programming language. Wys* improves on Wysteria along three lines: (a) It enables programmers to formally verify the correctness and security properties of their programs. As far as we know, Wys* is the first language to provide verification capabilities for MPC programs. (b) It provides a partially verified toolchain to run MPC programs, and finally (c) It enables the MPC programs to use, with no extra effort, standard language constructs from the host language F*, thereby making it more usable and scalable. Finally, the dissertation develops static analyses that help optimize monolithic MPC programs into mixed-mode MPC programs, while providing similar privacy guarantees as the monolithic versions.

Using Quantitative Methods to Explore Political Leverage, Trade Policy, and Food Security: A Case Study of the Middle East

This dissertation explores why some states consistently secure food imports at prices higher than the world market price, thereby exacerbating food insecurity domestically. I challenge the idea that free market economics alone can explain these trade behaviors, and instead argue that states take into account political considerations when engaging in food trade that results in inefficient trade. In particular, states that are dependent on imports of staple food products, like cereals, are wary of the potential strategic value of these goods to exporters. I argue that this consideration, combined with the importing state’s ability to mitigate that risk through its own forms of political or economic leverage, will shape the behavior of the importing state and contribute to its potential for food security. In addition to cross-national analyses, I use case studies of the Gulf Cooperation Council states and Jordan to demonstrate how the political tools available to these importers affect their food security. The results of my analyses suggest that when import dependent states have access to forms of political leverage, they are more likely to trade efficiently, thereby increasing their potential for food security.