Arrow Research search
Back to FOCS

FOCS 1999

Non-Interactive CryptoComputing For NC 1

Conference Paper Session 10B Algorithms and Complexity ยท Theoretical Computer Science

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 polynomial time for NC/sup 1/ circuits. The protocol involves an input party sending encrypted input to a second party, a cryptocomputer, which evaluates the circuit (or a known circuit over its additional private input) non-interactively, securely and obliviously, and provides the output to the input party without learning it. This improves on previous (general) results that are specialized to the case of NC/sup 1/ circuits and require a constant number of communication rounds. We further suggest applications to network and mobile computing.

Authors

Keywords

  • Circuits
  • Computer science
  • Public key cryptography
  • Public key
  • Polynomials
  • Protocols
  • Computer networks
  • Digital Networks
  • Encrypted Data
  • Algebraic Structure
  • Semigroup
  • Encryption Scheme
  • Public Schemes
  • Security Evaluation
  • Decoding
  • Input Values
  • Error Probability
  • Plaintext
  • Abelian Group
  • Output Distribution
  • Node Level
  • Gate Opening
  • OR Operation
  • Random Element
  • Multi-party Computation
  • Security Parameter
  • OR Gate
  • NOT Gate
  • Zero-knowledge Proof
  • Input Bits
  • Output Elements
  • Encoding Vector
  • Mobile Agents

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
80346475530137936