On the Hardness of Information-Theoretic Multiparty Computation

@inproceedings{Ishai2004OnTH,
  title={On the Hardness of Information-Theoretic Multiparty Computation},
  author={Yuval Ishai and Eyal Kushilevitz},
  booktitle={EUROCRYPT},
  year={2004}
}
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational complexity of the function being computed? For instance, can computationally unbounded players compute an arbitrary function of their inputs with polynomial communication complexity and a linear threshold of unconditional privacy? Can this be done using a constant number of communication rounds? We provide an explanation… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

The capacity of private information retrieval with colluding databases

2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP) • 2016
View 5 Excerpts
Highly Influenced

Communication and Randomness Lower Bounds for Secure Computation

IEEE Transactions on Information Theory • 2016
View 7 Excerpts
Highly Influenced

Theory of Cryptography

Lecture Notes in Computer Science • 2014
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Similar Papers

Loading similar papers…