CryptoDB
Combining Computational and Information-Theoretic Security in Multi-Party Computation
Authors: | |
---|---|
Download: | |
Abstract: |
Most protocols for multi-party computation (MPC) are secure either
against information-theoretic (IT) or against computationally bounded
adversaries. In this work, we bring together the best of both worlds:
For any robustness parameter $\rob<\frac{n}{2}$ we obtain one MPC
protocol that is simultaneously IT secure with robustness for up to
$t\leq\rob$ actively corrupted parties, IT secure with fairness (no
robustness) for up to $t<\frac{n}{2}$ and computationally secure with
agreement on abort (no fairness) for up to $t |
BibTeX
@misc{eprint-2009-18214, title={Combining Computational and Information-Theoretic Security in Multi-Party Computation}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / multi-party computation, information-theoretic security, computational security, hybrid security, robustness, fairness, agreement on abort, universal composability}, url={http://eprint.iacr.org/2009/009}, note={ d.raub@inf.ethz.ch 14249 received 5 Jan 2009}, author={Christoph Lucas and Dominik Raub and Ueli Maurer}, year=2009 }