Sciweavers

Share
176 search results - page 2 / 36
» On the Round Complexity of Covert Computation
Sort
View
ASIACRYPT
2010
Springer
8 years 9 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
ICICS
2004
Springer
9 years 5 months ago
Automatic Covert Channel Analysis of a Multilevel Secure Component
Abstract. The NRL Pump protocol deļ¬nes a multilevel secure component whose goal is to minimize leaks of information from high level systems to lower level systems, without degrad...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone...
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
9 years 5 months ago
The round complexity of two-party random selection
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...
Saurabh Sanghvi, Salil P. Vadhan
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
9 years 5 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
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...
Ivan Damgård, Yuval Ishai
books