Non-interactive cryptocomputing for NC/sup 1/

@article{Sander1999NoninteractiveCF,
  title={Non-interactive cryptocomputing for NC/sup 1/},
  author={T. Sander and Adam L. Young and M. Yung},
  journal={40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)},
  year={1999},
  pages={554-566}
}
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… Expand
Minimal-Latency Secure Function Evaluation
TLDR
Novel parallelization techniques are introduced that reduce the constant to 1 with preprocessing, which resolves the conjecture that NLOGSPACE subcomputations (including log-slices of circuit computation) can be evaluated with latency 1 (as opposed to just O(1)). Expand
Secure Multi-party Computation Minimizing Online Rounds
TLDR
This work asks whether preprocessing can allow low latency (that is, small round) secure multi-party protocols that are universally-composable (UC) and allows any polynomial time preprocessing as long as it is independent of the exact circuit and actual inputs of the specific instance problem to solve. Expand
CRT based somewhat homomorphic encryption over the integers
TLDR
The implementation of the CRT-based somewhat homomorphic encryption over the integers scheme is introduced to provide a proof of concept of this new and promising encryption algorithm. Expand
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
TLDR
Lower bounds are developed which give a smooth trade-off between the communication complexity and the “expressiveness” of the cryptosystem---the latter being measured in terms of the depth of the arithmetic circuits that can be evaluated on ciphertext. Expand
Non-interactive and Output Expressive Private Comparison from Homomorphic Encryption
TLDR
This paper considers a variant setting of a fully homomorphic encryption scheme in which the inputs a and b as well as the result bit 1 {a > b} are encrypted, giving about 48 - 90 fold speed up over previous solutions. Expand
Statistically Secure Evaluation of Quadratic Functions and 2-CNF Circuits Over a Dynamic Set of Secret Shares
One of the most interesting research topics in cryptography is finding schemes for an efficient fully-homomorphic encryption (FHE), preferably information-theoretically secure schemes, which are notExpand
Communication Complexity in Algebraic Two-Party Protocols
TLDR
A general methodology for determining what types of protocols can and cannot be implemented with small communication by using homomorphic encryption in a black-box way is illustrated and a precise mathematical language for reasoning about such problems is developed. Expand
Efficient Non-interactive Secure Computation
TLDR
The first general protocols in this model which only make a black-box use of a pseudorandom generator (PRG) are presented, which improves over the state of the art also for interactive constant-round black- box protocols, which required Ω(κ) PRG calls per gate, even with similar relaxations of the notion of security. Expand
Constant-Round Private Function Evaluation with Linear Complexity
TLDR
A completely new technique for PFE is shown that avoids universal circuits, and results in constant-round protocols with communication/computational complexity linear in the size of the circuit computing f, which gives the first constant- round protocol for P FE with linear complexity (without using fully homomorphic encryption), even restricted to semi-honest adversaries. Expand
Statistically Secure One Multiplication and Additions of Secret Shares ( Preliminary version )
One of the most interesting research topics in cryptography is finding schemes for an efficient fully-homomorphic encryption (FHE), preferably information-theoretically secure schemes, which are notExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
TLDR
Any function can be evaluated in a constant number of rounds, using messages of size proportional to the size of a constant-depth, unbounded-fanin circuit describing the function, and a means to simulate unbounded fanin multiplicative (or AND) gates using constant rounds is provided. Expand
A New Public-Key Cryptosystem as Secure as Factoring
TLDR
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries. Expand
Number-theoretic constructions of efficient pseudo-random functions
  • M. Naor, O. Reingold
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
TLDR
A new construction of pseudo-random functions such that computing their value at any given point involves two multiple products, much more efficient than previous proposals. Expand
A new public key cryptosystem based on higher residues
TLDR
The probabilistic version of the scheme is an homomorphic encryption scheme whose expansion rate is much better than previously proposed such systems and has se- mantic security, relative to the hardness of computing higher residues for suitable moduli. Expand
The round complexity of secure protocols
TLDR
It is shown that a rigorously-specified and extremely strong notion of secure function evaluation can be achieved by a protocol which requires only a fixed constant number of rounds of interaction, and this result assumes only the existence of a one-way function. Expand
On Necessary Conditions for Secure Distributed Computation
TLDR
It is shown that in some cases the perfect security of multi-party protocols in a fully connected network requires all the channels to be physically secure, and a simple protocol for which if privacy of even one channel is compromised, the protocol can not be computed securely. Expand
On hiding information from an oracle
TLDR
The framework defined in this paper enables us to prove precise statements about what an encrypted instance hides and what it leaks, in an information-theoretic sense, about some natural problems in NP ⋒ CoNP. Expand
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)
TLDR
The results show that any algebraically homomorphic cryptosystem can be broken in sub-exponential time and it is proved that manipulating black box fields over the rationals is as hard as factoring integers. Expand
How to generate and exchange secrets
  • A. Yao
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is applied to solve a general class of problems which include most of theExpand
Nonmalleable Cryptography
TLDR
The cryptosystem is the first proven to be secure against a strong type of chosen ciphertext attack proposed by Rackoff and Simon, in which the attacker knows the ciphertext she wishes to break and can query the decryption oracle on any ciphertext other than the target. Expand
...
1
2
3
4
5
...