Abstract
In this paper we study the randomness complexity needed to distributively perform k XOR computation in a t-private way using constant-round protocols.
We show that cover-free families allow the recycling of random bits for constant-round private protocols. More precisely, we show that after an 1-round initialization phase during which random bits are distributed among the players, it is possible to perform each of k XOR computations using 2-rounds of communication. In each phase the random bits are used according to a cover-free family and this allows to use each random bit for more than one computation.
For t = 2, we design a protocol that uses O(n log k) random bits in- stead of O(nk) bits if no recycling is performed. More generally, if t > 1 then O(kt 2 log n) random bits are sufficient to accomplisht his task, for t = O(n ½—є) for constant є > 0 .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of round of interaction. In Proceedings of 8th ACM Symposium on Principles of Distributed Computing, pages 36–44, 1989.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Advances in Cryptology–CRYPTO 90, pages 62–76, 1990.
D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proceedings of 22th Symposium on Theory of Computation, pages 503–513, 1990.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of 20th Symposium on Theory of Computation, pages 1–10, 1988.
C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro. Randomness complexity of private multiparty protocols. To appear in Computational Complexity (preliminary version ICALP 95), 1998.
D. Chaum, C. Crepeau, and I. Damgärd. Multiparty unconditionally secure protocols. In Proceedings of 20th Symposium on Theory of Computation, pages 11–19, 1988.
B. Chor and E. Kushilevitz. A communication-privacy tradeoff for modular addition. Information Processing Letters, 45:205–210, 1991.
B. Chor and E. Kushilevitz. A zero-one law for boolean privacy. SIAM Journal of Disc. Mat., 4(1):36–46, 1991.
D.Z. Du and F.K. Hwang. Combinatorial Groups Testing and its Applications. World Scientific, Singapore, 1993.
P. Erdös, P. Frankl, and Z. Füredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79–89, 1985.
E. Kushilevitz and Y. Mansour. Small sample spaces and privacy. In Proceedings of 15th ACM Symposium on Principles of Distributed Computing, 1996.
E. Kushilevitz, R. Ostrovsky, and A. Rosèn. Characterizing linear size circuit in terms of privacy. In Proceedings of 28th ACM Symposium on Theory of Computing, 1996.
E. Kushilevitz, R. Ostrovsky, and A. Rosèn. Amortizing randomness in private multiparty computations. In Proc. Seventeenth ACM Symposium on Principles of Distributed Computing, 1998.
E. Kushilevitz and A. Rosèn. A randomness-round tradeoff in private computation. SIAM Journal of Disc. Mat., 11(1):61–80, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blundo, C., Galdi, C., Persiano, P. (1999). Randomness Recycling in Constant-Round Private Computations. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_10
Download citation
DOI: https://doi.org/10.1007/3-540-48169-9_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66531-1
Online ISBN: 978-3-540-48169-0
eBook Packages: Springer Book Archive