-
Article
Open AccessVitamin D3 supplementation and treatment outcomes in patients with depression (D3-vit-dep)
To examine whether vitamin D supplementation in patients with depression would result in a reduction in Hamilton D-17 depression score (primary outcome) at 3 and 6 months compared to controls and to explore th...
-
Article
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Our first contribution is the first ...
-
Chapter and Conference Paper
Confidential Benchmarking Based on Multiparty Computation
We report on the design and implementation of a system that uses multiparty computation to enable banks to benchmark their customers’ confidential performance data against a large representative set of confide...
-
Chapter and Conference Paper
Better Preprocessing for Secure Multiparty Computation
We present techniques and protocols for the preprocessing of secure multiparty computation (MPC), focusing on the so-called SPDZ MPC scheme [14] and its derivatives [1, 11, 13]. These MPC schemes consist of a so-...
-
Article
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
We propose a protocol for the problem of secure two-party pattern matching, where Alice holds a text t∈{0,1}∗ of length n, while Bob has a pattern p∈{0,1}∗ of length m. The goal is for Bob to (only) learn where h...
-
Chapter and Conference Paper
An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation
Recent developments in Multi-party Computation (MPC) has resulted in very efficient protocols for dishonest majority in the preprocessing model. In particular, two very promising protocols for Boolean circuits...
-
Chapter and Conference Paper
A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
Secure multiparty computation (MPC) – computation on distributed, private inputs – has been studied for thirty years. This includes “one shot” applications as well as reactive tasks, where the exact computatio...
-
Article
Open AccessPrivacy-preserving distributed clustering
Clustering is a very important tool in data mining and is widely used in on-line services for medical, financial and social environments. The main goal in clustering is to create sets of similar objects in a d...
-
Chapter and Conference Paper
Secure Equality and Greater-Than Tests with Sublinear Online Complexity
Secure multiparty computation (MPC) allows multiple parties to evaluate functions without disclosing the private inputs. Secure comparisons (testing equality and greater-than) are important primitives required...
-
Article
High-performance secure multi-party computation for data mining applications
Secure multi-party computation (MPC) is a technique well suited for privacy-preserving data mining. Even with the recent progress in two-party computation techniques such as fully homomorphic encryption, gener...
-
Chapter and Conference Paper
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Our first contribution is the first ...
-
Chapter and Conference Paper
Secure Computation, I/O-Efficient Algorithms and Distributed Signatures
We consider a setting where a set of n players use a set of m servers to store a large, private data set. Later the players decide on functions they want to compute on the data without the servers needing to know...
-
Chapter and Conference Paper
On Secure Two-Party Integer Division
We consider the problem of secure integer division: given two Paillier encryptions of ℓ-bit values n and d, determine an encryption of $\lfloo...
-
Chapter and Conference Paper
Sub-linear, Secure Comparison with Two Non-colluding Parties
The classic problem in the field of secure computation is Yao’s millionaires’ problem; we consider two new protocols solving a variation of this: a number of parties, P 1,..., P ...
-
Chapter and Conference Paper
Linear, Constant-Rounds Bit-Decomposition
When performing secure multiparty computation, tasks may often be simple or difficult depending on the representation chosen. Hence, being able to switch representation efficiently may allow more efficient pro...
-
Chapter and Conference Paper
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
We propose a dedicated protocol for the highly motivated problem of secure two-party pattern matching: Alice holds a text t ∈ {0,1}*. of length n, while Bob has a pattern p ∈ {0,1}*. of length m. The goal is for ...
-
Chapter and Conference Paper
Secret Sharing Comparison by Transformation and Rotation
Given any linear secret sharing scheme with a multiplication protocol, we show that a given set of players holding shares of two values ...
-
Chapter and Conference Paper
Privacy-Preserving Face Recognition
Face recognition is increasingly deployed as a means to unobtrusively verify the identity of people. The widespread use of biometrics raises important privacy concerns, in particular if the biometric matching ...
-
Chapter and Conference Paper
Secure Multiparty Computation Goes Live
In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used.
-
Chapter and Conference Paper
Solving Linear Programs Using Multiparty Computation
Solving linear programming (LP) problems can be used to solve many different types of problems. Immediate examples include certain types of auctions as well as benchmarking. However, the input data may origina...
