677 search results - page 54 / 136 » Secure Pseudonymous Channels |
101
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
There is a vast body of work on implementing anonymous communication. In this paper, we study the possibility of using anonymous communication as a building block, and show that o...
107
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
100
click to vote
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
111
click to vote
IEEEIA
2009
14 years 9 months ago
2009
Covert channel attacks utilize shared resources to indirectly transmit sensitive information to unauthorized parties. Current security mechanisms such as SELinux rely on tagging th...