A domain-specific programming language for secure multiparty computation

Nielsen, Janus Dam; Schwartzbach, Michael I.

doi:10.1145/1255329.1255333

Cited by 44 publications

(36 citation statements)

References 59 publications

(85 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several languages for programming secure computation systems have been proposed [21,25,15,32,22]. However, these language do not provide a clear separation of data with different policies on the type system level.…”

Section: Introductionmentioning

confidence: 99%

Domain-Polymorphic Programming of Privacy-Preserving Applications

Bogdanov

Laud

Randmets

2014

Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security

View full text Add to dashboard Cite

Secure Multiparty Computation (SMC) is seen as one of the main enablers for secure outsourcing of computation. Currently, there are many different SMC techniques (garbled circuits, secret sharing, homomorphic encryption, etc.) and none of them is clearly superior to others in terms of efficiency, security guarantees, ease of implementation, etc. For maximum efficiency, and for obeying the trust policies, a privacy-preserving application may wish to use several different SMC techniques for different operations it performs. A straightforward implementation of this application may result in a program that (i) contains a lot of duplicated code, differing only in the used SMC technique; (ii) is difficult to maintain, if policies or SMC implementations change; and (iii) is difficult to reuse in similar applications using different SMC techniques.In this paper, we propose a programming language with associated compilation techniques for simple orchestration of multiple SMC techniques and multiple protection domains. It is a simple imperative language with function calls where the types of data items are annotated with protection domains and where the function declarations may be domain-polymorphic. This allows most of the program code working with private data to be written in a SMC-techniqueagnostic manner. It also allows rapid deployment of new SMC techniques and implementations in existing applications. We have implemented the compiler for the language, integrated it with an existing SMC framework, and are currently using it for new privacy-preserving applications.

show abstract

Section: Introductionmentioning

confidence: 99%

Domain-Polymorphic Programming of Privacy-Preserving Applications

Bogdanov

Laud

Randmets

2014

Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security

View full text Add to dashboard Cite

show abstract

“…Generally they accept as input a program written in a Turingcomplete programming language, which can be either imperative [74,15,47,73,83,110,108,25,26,72] or descriptive [97]. The systems outputs can be boolean circuits [74,15,47], source code in a generic programming language [73,110,108,25,26,72], or a running protocol [97].…”

Section: Programming Toolsmentioning

confidence: 99%

“…The systems outputs can be boolean circuits [74,15,47], source code in a generic programming language [73,110,108,25,26,72], or a running protocol [97]. Some systems [74,15,47,97,73] employed cryptographic primitives to enable secure computation, whereas others [110,108,25,26,72,83] did not. Instead, they were designed as tools that use types or annotations to specify security properties and apply various static analysis techniques to ensure the security requirements are met.…”

Section: Programming Toolsmentioning

confidence: 99%

See 1 more Smart Citation

Practical Secure Two-Party Computation

Huang

View full text Add to dashboard Cite

Secure two-party computation allows two parties to cooperatively evaluate a function that takes both parties' private data as input without revealing any private information other than the outcome. Although secure computation has many important applications in various fields and a general theoretical solution has been known for decades, practical systems are rare due to the prohibitive performance overhead and the tremendous effort required to build such systems.The garbled circuit (i.e., Yao's circuit) technique enables secure computing of polynomial-time computable functions but has previously been thought to be too expensive for practical applications. We improved the efficiency of garbled circuits focusing on both execution and design aspects. Our implementation uses pipelining aggressively so the circuit execution runs with a nearly constant amount of memory and can scale to arbitrarily large circuits. To aid the efficient construction of circuits, we developed a library of component circuits that enables programmers to quickly create new ones by modular composition of existing ones. We integrated these ideas into a new framework that enables programmers to develope secure computation protocols from an existing insecure implementation while providing enough control over the circuit design to enable efficient implementation. To evaluate the effectiveness of our techniques and our new tools, we build several privacy-preserving applications which are secure against passive adversaries, including secure biometric identification, secure edit distance and Smith-Waterman, private encryption, and private set intersection.The secure guarantees of passively-secure protocols do not hold if an attacker goes "active" -by deviating from the protocol specification. To thwart active adversaries, we present a concrete design and implementation of protocols achieving security guarantees that are much stronger than are possible with passively-secure protocols, at minimal extra cost. We consider protocols in which a malicious adversary may learn a single (arbitrary) bit of additional information about the honest party's input. Correctness of the honest party's output is still guaranteed. Adapting prior work of Mohassel and Franklin, the basic idea in our protocols is to conduct two separate runs of a (specific) semi-honest, garbled-circuit protocol, with the parties swapping roles, followed by an inexpensive secure equality test. We provide a rigorous definition and prove that this protocol leaks no more than one additional bit against a malicious adversary. In addition, we propose some i Abstract ii heuristic enhancements to reduce the overall information a cheating adversary learns. Our experiments show that protocols meeting this security level can be implemented at a cost very close to protocols that only achieve semi-honest security. Our results indicate that this model enables the large-scale, practical applications possible within the semi-honest security model, while providing stronger security guarantees.We al...

show abstract

“…That is, by expressing their programs in a more natural manner and using automated analysis, optimisation and transformation, a programmer will improve their productivity, reduce their rate of error and generally produce software of a higher quality. Systems such as Cryptol [23], Sokrates [8], LaCodA [24] and SIMAP [29] have started to address this issue at various levels. Focusing on ECC based primitives, so that our domain is slightly orthogonal to previous work, we investigate three overarching topics: description of ECC based primitives in a natural manner using the CAO [30] language; automatic optimisation of those primitives using novel extensions to the CAO compiler; and the security implications of using specific forms of automation.…”

Section: Introductionmentioning

confidence: 99%

Compiler Assisted Elliptic Curve Cryptography

Barbosa

Moss

Page

On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS

View full text Add to dashboard Cite

Abstract. Although cryptographic software implementation is often performed by expert programmers, the range of performance and security driven options, as well as more mundane software engineering issues, still make it a challenge. The use of domain specific language and compiler techniques to assist in description and optimisation of cryptographic software is an interesting research challenge. Our results, which focus on Elliptic Curve Cryptography (ECC), show that a suitable language allows description of ECC based software in a manner close to the original mathematics; the corresponding compiler allows automatic production of an executable whose performance is competitive with that of a handoptimised implementation. Our work are set within the context of CACE, an ongoing EU funded project on this general topic.

show abstract

A domain-specific programming language for secure multiparty computation

Cited by 44 publications

References 59 publications

Domain-Polymorphic Programming of Privacy-Preserving Applications

Domain-Polymorphic Programming of Privacy-Preserving Applications

Practical Secure Two-Party Computation

Compiler Assisted Elliptic Curve Cryptography

Contact Info

Product

Resources

About