Taype: A Policy-Agnostic Language for Oblivious Computation
Secure multiparty computation (MPC) allows for joint computation over private data from multiple entities, usually backed by powerful cryptographic techniques that protect sensitive data. Several high-level programming languages have been proposed to make writing MPC applications accessible to non-experts. These languages typically require developers to enforce security policies within the logic of the secure application itself, making it difficult to update security requirements, or to experiment with different policies. This paper presents the design and implementation of Taype, a language that permits security concerns to be decoupled from the program logic. To do so, Taype provides the first implementation of oblivious algebraic data types and tape semantics, two language features recently proposed by a core calculus for oblivious computation, λOADT✚. We evaluate our implementation of Taype on a range of benchmarks, demonstrating its ability to encode a range of security polices for a rich class of data types.
Tue 20 JunDisplayed time zone: Eastern Time (US & Canada) change
09:00 - 11:00 | |||
09:00 20mTalk | Obtaining Information Leakage Bounds via Approximate Model Counting PLDI Research Papers Seemanta Saha University of California Santa Barbara, Surendra Ghentiyala University of California Santa Barbara, Shihua Lu University of California Santa Barbara, Lucas Bang Harvey Mudd College, Tevfik Bultan University of California at Santa Barbara DOI | ||
09:20 20mTalk | CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity PLDI Research Papers DOI | ||
09:40 20mTalk | Discrete Adversarial Attack to Models of Code PLDI Research Papers Fengjuan Gao Nanjing University of Science and Technology, Yu Wang Nanjing University, Ke Wang Visa Research DOI | ||
10:00 20mTalk | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation PLDI Research Papers Shamiek Mangipudi Università della Svizzera italiana (USI), Pavel Chuprikov USI Lugano, Patrick Eugster USI Lugano; Purdue University, Malte Viering TU Darmstadt, Savvas Savvides Purdue University DOI | ||
10:20 20mTalk | Taype: A Policy-Agnostic Language for Oblivious Computation PLDI Research Papers DOI | ||
10:40 20mTalk | Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs PLDI Research Papers Shankara Pailoor University of Texas at Austin, Yanju Chen University of California at Santa Barbara, Franklyn Wang Harvard University, 0xparc, Clara Rodríguez-Núñez Complutense University of Madrid, Jacob Van Geffen Veridise Inc., Jason Morton ZKonduit, Michael Chu 0xparc, Brian Gu 0xparc, Yu Feng University of California at Santa Barbara, Işıl Dillig University of Texas at Austin DOI |