Low-randomness constant-round private XOR computations
- 8 August 2006
- journal article
- Published by Springer Nature in International Journal of Information Security
- Vol. 6 (1) , 15-26
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Security with Low Communication Overhead2001
- Randomness Recycling in Constant-Round Private ComputationsLecture Notes in Computer Science, 1999
- A Randomness-Rounds Tradeoff in Private ComputationSIAM Journal on Discrete Mathematics, 1998
- Amortizing randomness in private multiparty computations1998
- Randomness in Private ComputationsSIAM Journal on Discrete Mathematics, 1997
- Characterizing linear size circuits in terms of privacy1996
- A communication-privacy tradeoff for modular additionInformation Processing Letters, 1993
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction1989
- Families of finite sets in which no set is covered by the union ofr othersIsrael Journal of Mathematics, 1985