58 search results - page 10 / 12 » Provable Anonymity for Networks of Mixes |
CTRSA
2004
Springer
14 years 25 days 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...
FC
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
NDSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Although several wide-spread internet applications (e.g., job-referral services, dating services) can benefit from online matchmaking, protocols defined over the past two decade...
CCS
2003
ACM
14 years 20 days ago
2003
ACM
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
ICISC
2004
13 years 8 months ago
2004
In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n - t entities to generate a publicly verifiable t-out-of-n signature on behalf of ...