3,773 research outputs found
Scather: programming with multi-party computation and MapReduce
We present a prototype of a distributed computational infrastructure, an associated high level programming language, and an underlying formal framework that allow multiple parties to leverage their own cloud-based computational resources (capable of supporting MapReduce [27] operations) in concert with multi-party computation (MPC) to execute statistical analysis algorithms that have privacy-preserving properties. Our architecture allows a data analyst unfamiliar with MPC to: (1) author an analysis algorithm that is agnostic with regard to data privacy policies, (2) to use an automated process to derive algorithm implementation variants that have different privacy and performance properties, and (3) to compile those implementation variants so that they can be deployed on an infrastructures that allows computations to take place locally within each participant’s MapReduce cluster as well as across all the participants’ clusters using an MPC protocol. We describe implementation details of the architecture, discuss and demonstrate how the formal framework enables the exploration of tradeoffs between the efficiency and privacy properties of an analysis algorithm, and present two example applications that illustrate how such an infrastructure can be utilized in practice.This work was supported in part by NSF Grants: #1430145, #1414119, #1347522, and #1012798
An Embedded Domain-Specific Language for Logical Circuit Descriptions with Applications to Garbled Circuits
Contemporary libraries and frameworks that make it possible to incorporate secure multi-party computation protocols and capabilities into production software systems and applications must sometimes deliver underlying capabilities (such as logical circuit synthesis) to new kinds of environments (such as web browsers or serverless cloud computing platforms). In order to illustrate some of the benefits of addressing this challenge by building a solution from the ground up that leverages the features of a contemporary and widely used programming language, we present an embedded domain-specific language that allows programmers to describe and synthesize logical circuits. Notably, this approach allows programmers to employ many of the language features and any of the programming paradigms supported by the host language. We illustrate this flexibility by considering two use cases: synthesizing circuits for relational operations and synthesizing circuits corresponding to the SHA-256 cryptographic hash function
Programming support for an integrated multi-party computation and MapReduce infrastructure
We describe and present a prototype of a distributed computational infrastructure and associated high-level programming language that allow multiple parties to leverage their own computational resources capable of supporting MapReduce [1] operations in combination with multi-party computation (MPC). Our architecture allows a programmer to author and compile a protocol using a uniform collection of standard constructs, even when that protocol involves computations that take place locally within each participant’s MapReduce cluster as well as across all the participants using an MPC protocol. The highlevel programming language provided to the user is accompanied by static analysis algorithms that allow the programmer to reason about the efficiency of the protocol before compiling and running it. We present two example applications demonstrating how such an infrastructure can be employed.This work was supported in part
by NSF Grants: #1430145, #1414119, #1347522, and #1012798
MaxSAT Evaluation 2022 : Solver and Benchmark Descriptions
Non peer reviewe
General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
With a focus on universal quantum computing for quantum simulation, and
through the example of lattice gauge theories, we introduce rather general
quantum algorithms that can efficiently simulate certain classes of
interactions consisting of correlated changes in multiple (bosonic and
fermionic) quantum numbers with non-trivial functional coefficients. In
particular, we analyze diagonalization of Hamiltonian terms using a
singular-value decomposition technique, and discuss how the achieved diagonal
unitaries in the digitized time-evolution operator can be implemented. The
lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions
coupled to one flavor of staggered fermions, for which a complete
quantum-resource analysis within different computational models is presented.
The algorithms are shown to be applicable to higher-dimensional theories as
well as to other Abelian and non-Abelian gauge theories. The example chosen
further demonstrates the importance of adopting efficient theoretical
formulations: it is shown that an explicitly gauge-invariant formulation using
loop, string, and hadron (LSH) degrees of freedom simplifies the algorithms and
lowers the cost compared with the standard formulations based on
angular-momentum as well as the Schwinger-boson degrees of freedom. The LSH
formulation further retains the non-Abelian gauge symmetry despite the
inexactness of the digitized simulation, without the need for costly controlled
operations. Such theoretical and algorithmic considerations are likely to be
essential in quantum simulating other complex theories of relevance to nature.Comment: 59+17+7 pages, 16 figure
- …