-
Chapter and Conference Paper
Passive Corruption in Statistical Multi-Party Computation
The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way. For this purpose, a fixed set of n parties runs a protocol that tolerates an adv...
-
Chapter and Conference Paper
Graceful Degradation in Multi-Party Computation (Extended Abstract)
The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way. For this purpose, a fixed set of n parties runs a protocol that tolerates an adv...
-
Chapter and Conference Paper
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
While general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model, there are SFE protocols (Goldreich et al. [STO...
-
Chapter and Conference Paper
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field \(\mathbb{F}\) , to determine a secret fiel...
-
Chapter and Conference Paper
An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction
A prerequisite for processing privacy-sensitive data with automatic tools is a fine-grained formalization of privacy policies along with appropriate operators to manipulate such policies. The most promising re...
-
Chapter and Conference Paper
On the Security and Composability of the One Time Pad
Motivated by a potentially flawed deployment of the one time pad in a recent quantum cryptographic application securing a bank transfer [1], we show how to implement a statistically secure system for message p...
