208 search results - page 11 / 42 » Computing Anonymously with Arbitrary Knowledge |
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
CTRSA
2004
Springer
14 years 3 months ago
2004
Springer
We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits reencryption, such as ElGamal, does so only for a player w...
ISCN
2006
IEEE
14 years 4 months ago
2006
IEEE
Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want ...
COGSCI
2004
13 years 10 months ago
2004
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...
NETWORKS
2006
13 years 10 months ago
2006
Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...