Page
%P
-
Chapter and Conference Paper
Secure Two-Party Computation in a Quantum World
Secure multi-party computation has been extensively studied in the past years and has reached a level that is considered practical for several applications. The techniques developed thus far have been steadily...
-
Article
On compiling Boolean circuits optimized for secure multi-party computation
Secure multi-party computation (MPC) allows two or more distrusting parties to jointly evaluate a function over private inputs. For a long time considered to be a purely theoretical concept, MPC transitioned i...
-
Book
-
Chapter
Introduction
Recent years have seen an increase in applications that collect and analyze private data on potentially untrusted machines. With the predominant use of cloud services, computations that were previously perform...
-
Chapter
Towards Scalable and Optimizing Compilation for MPC
The drawback of holistic optimizations on the gate level, as in CBMC-GC, are their very limited scalability. Therefore, previous efforts in compiler research for MPC focussed either on the development of scala...
-
Chapter
Background
In this chapter, we give the necessary background information on secure computation and Boolean circuits to follow the ideas presented in the book. We describe Boolean circuits, two secure computation protocol...
-
Chapter
Compiling ANSI-C Code into Boolean Circuits
The practicality of Secure Multi-party Computation (MPC) is hindered by the difficulty to implement applications on top of the underlying cryptographic protocols. This is because the manual construction of eff...
-
Chapter
Compiling Parallel Circuits
Practical MPC has seen a lot of progress over the past decade. Yet, compared with generic computation, MPC is still multiple orders of magnitude slower. To improve the efficiency of secure computation protocol...
-
Chapter
Compiling Size-Optimized Circuits for Constant-Round MPC Protocols
Even though MPC became practical in recent years, it is still multiple orders of magnitude slower than generic computation. Therefore, when designing efficient applications for MPC protocols, it is of interest...
-
Chapter
Compiling Depth-Optimized Circuits for Multi-Round MPC Protocols
Many MPC protocols, such as GMW and SPDZ, have a round complexity that is dependent on the circuit’s depth. When deploying these protocols in real world network settings, with network latencies in the range of...
-
Chapter and Conference Paper
Consumer Privacy on Distributed Energy Markets
Recently, several privacy-enhancing technologies for smart grids have been proposed. However, most of these solutions presume the cooperation of all smart grid participants. Hence, the privacy protection of co...
-
Chapter and Conference Paper
Breaking reCAPTCHA: A Holistic Approach via Shape Recognition
CAPTCHAs are small puzzles which should be easily solvable by human beings but hard to solve for computers. They build a security cornerstone of the modern Internet service landscape, deployed in essentially a...
