Name
Abstract | ||
|---|---|---|
In this paper we study the randomness complexity needed to distributively perform k XOR computations in a t-private way using constant-round protocols in the case in which the players are honest but curious.We show that the existence of a particular family of subsets allows the recycling of random bits for constant-round private protocols. More precisely, we show that after a 1-round initialization phase during which random bits are distributed among n players, it is possible to perform each of the k XOR computations using two rounds of communication.For $$t\leq c\sqrt{n/\log n}$$, for any c O(kt2log n) random bits. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10207-006-0007-5 | Int. J. Inf. Sec. |
Keywords | DocType | Volume |
it is possible to per- form each of thekxor computations using two rounds of communication. keywords multiparty computation · randomness,n player,k XOR computation,random bit,we show that aftera1-roundinitializationphaseduringwhichrandom bits are distributed amongnplayers,log n,we show that the existence of a particular family of subsets allows the recycling of random bits for constant- round private protocols. more precisely,constant-round protocol,kt2log n,private XOR computation,constant-round private protocol,c O,k XOR,1-round initialization phase | Journal | 6 |
Issue | ISSN | Citations |
1 | 1615-5270 | 2 |
PageRank | References | Authors |
0.40 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlo Blundo | 1 | 1901 | 229.50 |
| Clemente Galdi | 2 | 150 | 22.16 |
| Giuseppe Persiano | 3 | 1773 | 152.14 |