156 search results - page 13 / 32 » On the Round Complexity of Covert Computation |
216
Voted
DAM
2007
15 years 8 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
175
Voted
EUROCRYPT
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
220
Voted
SODA
2000
ACM
15 years 9 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
168
click to vote
CRYPTO
2000
Springer
16 years 13 days ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
172
click to vote
CIE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...