156 search results - page 2 / 32 » On the Round Complexity of Covert Computation |
FOCS
2003
IEEE
13 years 9 months ago
2003
IEEE
ICICS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. The NRL Pump protocol defines a multilevel secure component whose goal is to minimize leaks of information from high level systems to lower level systems, without degrad...
STOC
2005
ACM
13 years 10 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
CRYPTO
2005
Springer
13 years 9 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...