CryptoDB
Secure Computation Without Authentication
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Research on secure multiparty computation has mainly concentrated on the case where the parties can authenticate each other and the communication between them. This work addresses the question of what security can be guaranteed when authentication is not available. We consider a completely unauthenticated setting, where all messages sent by the parties may be tampered with and modified by the adversary without the honest parties being able to detect this fact. In this model, it is not possible to achieve the same level of security as in the authenticated-channel setting. Nevertheless, we show that meaningful security guarantees can be provided: Essentially, all the adversary can do is to partition the network into disjoint sets, where in each set the computation is secure in itself, and also independent of the computation in the other sets. In the basic setting our construction provides, for the first time, non-trivial security guarantees in a model with no set-up assumptions whatsoever. We also obtain similar results while guaranteeing universal composability, in some variants of the common reference string model. Finally, our protocols can be used to provide conceptually simple and unified solutions to a number of problems that were studied separately in the past, including password-based authenticated key exchange and non-malleable commitments. As an application of our results, we study the question of constructing secure protocols in partially-authenticated networks, where some of the links are authenticated and some are not (as is the case in most networks today). |
BibTeX
@misc{eprint-2007-13744,
title={Secure Computation Without Authentication},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / secure computation, authentication, secure composition, password-based authentication},
url={http://eprint.iacr.org/2007/464},
note={An extended abstract of this work appeared in Crypto 2005. canetti@csail.mit.edu 13864 received 16 Dec 2007},
author={Boaz Barak and Ran Canetti and Yehuda Lindell and Rafael Pass and Tal Rabin},
year=2007
}