DMCA
Non-Interactive CryptoComputing for NC1 (1999)
| Venue: | In 40th Annual Symposium on Foundations of Computer Science |
| Citations: | 92 - 1 self |
BibTeX
@INPROCEEDINGS{Sander99non-interactivecryptocomputing,
author = {Tomas Sander and Adam Young and Moti Yung},
title = {Non-Interactive CryptoComputing for NC1},
booktitle = {In 40th Annual Symposium on Foundations of Computer Science},
year = {1999},
pages = {554--567},
publisher = {IEEE}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The area of "computing with encrypted data" has been studied by numerous authors in the past twenty years since it is fundamental to understanding properties of encryption and it has many practical applications. The related fundamental area of "secure function evaluation" has been studied since the mid 80's. In its basic two-party case, two parties (Alice and Bob) evaluate a known circuit over private inputs (or a private input and a private circuit). Much attention has been paid to the important issue of minimizing rounds of computation in this model. Namely, the number of communication rounds in which Alice and Bob need to engage in to evaluate a circuit on encrypted data securely. Advancements in these areas have been recognized as open problems and have remained open for a number of years. In this paper we give a one round, and thus round optimal, protocol for secure evaluation of circuits which is in polynomialtime for NC
Keyphrases
non-interactive cryptocomputing private input known circuit much attention secure evaluation private circuit basic two-party case secure function evaluation important issue many practical application open problem numerous author related fundamental area past twenty year communication round
