Скачать или смотреть [POPL'22] Oblivious Algebraic Data Types

Oblivious Algebraic Data Types
Qianchuan Ye and Benjamin Delaware
(Purdue University, USA; Purdue University, USA)

Abstract: Secure computation allows multiple parties to compute joint
functions over private data without leaking any sensitive data,
typically using powerful cryptographic techniques. Writing secure
applications using these techniques directly can be challenging,
resulting in the development of several programming languages and
compilers that aim to make secure computation
accessible. Unfortunately, many of these languages either lack or
have limited support for rich recursive data structures, like trees.
In this paper, we propose a novel representation of structured
data types, which we call oblivious algebraic data types, and a
language for writing secure computations using them. This language
combines dependent types with constructs for oblivious computation,
and provides a security-type system which ensures that adversaries
can learn nothing more than the result of a computation. Using this
language, authors can write a single function over private data, and
then easily build an equivalent secure computation according to a
desired public view of their data.

Article: https://doi.org/10.1145/3498713

Supplementary archive: https://doi.org/10.5281/zenodo.5652106 (Badges: Artifacts Available, Artifacts Evaluated, Reusable)

Submitted to the conference by Qianchuan Ye on 2022-01-01

Video Tags: Dependent Types, Algebraic Data Types, Oblivious Computation, Multiparty Computation, popl22main-p429-p, doi:10.1145/3498713, doi:10.5281/zenodo.5652106, Artifacts Available, Artifacts Evaluated, Reusable

Presentation at the POPL 2022 conference, January 16, 2022, https://popl22.sigplan.org/
Sponsored by ACM SIGPLAN, https://www.sigplan.org/

Twitter:   / sigplan