Name
Abstract | ||
|---|---|---|
We consider the classic problem of n honest but curious players with private inputsx 1 ; : : : ; xn who wish to compute the value of a fixed function F(x 1 ; \Delta \Delta \Delta ; xn ) in such waythat at the end of the protocol every player knows the value F(x 1 ; \Delta \Delta \Delta ; xn ). Each pairof players is connected by a secure point-to-point communication channel. The playershave unbounded computational resources and they intend to compute F in a t-privateway. That is, after... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/s000370050025 | Computational Complexity |
Keywords | Field | DocType |
randomness complexity,private protocols,entropy.,randomness,information theory,cryptography,private computation,communication channels,entropy,point to point | Information theory,Integer,Discrete mathematics,Combinatorics,Fixed-function,Upper and lower bounds,Modulo,Corollary,Mathematics,Computation,Randomness | Journal |
Volume | Issue | ISSN |
8 | 2 | 1016-3328 |
Citations | PageRank | References |
4 | 0.42 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Blundo | 1 | 183 | 13.24 |
| Alfredo De Santis | 2 | 4049 | 501.27 |
| G. Persiano | 3 | 173 | 20.19 |
| U. Vaccaro | 4 | 213 | 21.04 |