Communication and Randomness Lower Bounds for Secure Computation

DOI10.1109/TIT.2016.2568207zbMath1359.94010arXiv1512.07735OpenAlexW2197751114MaRDI QIDQ2976700

Deepesh Data, Vinod M. Prabhakaran, Manoj Prabhakaran

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.07735

Mathematics Subject Classification ID

Communication theory (94A05)

Related Items (6)

Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Random sources in private computation ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND ⋮ Some Open Problems in Information-Theoretic Cryptography

This page was built for publication: Communication and Randomness Lower Bounds for Secure Computation