Sciweavers

2702 search results - page 177 / 541
» Message from the Editor
Sort
View
ASIACRYPT
2001
Springer
15 years 11 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
CRYPTO
2001
Springer
202views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Revocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
Dalit Naor, Moni Naor, Jeffery Lotspiech
IPPS
1997
IEEE
15 years 10 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
SIGCOMM
2010
ACM
15 years 6 months ago
Circumventing censorship with collage
Oppressive regimes and even democratic governments restrict Internet access. Existing anti-censorship systems often require users to connect through proxies, but these systems are...
Sam Burnett, Nick Feamster, Santosh Vempala
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 6 months ago
Variations on Information Embedding in Multiple Access and Broadcast Channels
Information embedding (IE) is the transmission of information within a host signal subject to a distortion constraint. There are two types of embedding methods, namely irreversibl...
Shivaprasad Kotagiri, J. Nicholas Laneman