Universal Re-encryption for Mixnets

By Philippe Golle, Markus Jakobsson, Ari Juels, Paul F. Syverson. The Cryptographer's Track at RSA Conference, 2004

465 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/024384b677b58c1f48697245b748ec291812b563

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Provable Anonymity for Networks of Mixes (2005, background): “Necessary properties may be implemented in many ways (cid:150) for example by slightly modi(cid:2)ed onions [14] or Universal Re-Encryption [9].”
Security and Cooperation in Wireless Networks (2007, methodology): “Later, this limitation was overcome by the universal re-encryption scheme proposed by Golle, Jakobsson, Juels, and Syverson in [155].”
Chosen-ciphertext secure proxy re-encryption (2007, background): “This work should not be confused with the “universal reencryption” literature [17], which re-randomizes ciphertexts instead of changing the underlying public key.”
"Yoking-proofs" for RFID tags (2004, unknown): “We suggest that such proofs are a useful tool for maintaining integrity in supply chains, particularly as RFID data will commonly flow across multiple, loosely affiliated organizations.”
RFID security and privacy: a research survey (2006, background): “[26] address this limitation in JP by proposing a simple cryptosystem that permits re-encryption of a ciphertext without knowledge of the corresponding public key.”
Blurry-ORAM: A Multi-Client Oblivious Storage Architecture (2016, methodology): “Rerandomization without knowledge of the public key can also be easily done, due to the homomorphic properties, by using the ideas from [7].”
A Survey of Homomorphic Encryption for Nonspecialists (2007, unknown): “…[3]), anonymity, privacy, electronic voting, electronic auctions, lottery protocols (see, e.g., [6]), protection of mobile agents (see, e.g., [7]), multiparty computation (see, e.g., [3]), mix-nets (see, e.g., [8, 9]), watermarking or ﬁnger-printing protocols (see, e.g., [10–14]), and so forth.”
The blocker tag: selective blocking of RFID tags for consumer privacy (2003, background): “[6] describe a similar scheme that is more suitable for privacy-protection of RFID tags embedded in consumer goods.”
Minimalist Cryptography for Low-Cost RFID Tags (2004, methodology): “A scheme of Golle, Jakobsson, Juels, and Syverson [17] builds on this idea with a primitive known as universal encryption, essentially a special extension of the El Gamal cryptosystem [13] in which re-encryption is possible without knowledge of public keys.”
The pynchon gate: a secure method of pseudonymous mail retrieval (2005, background): “Re-encryption mixes [35] aim to improve the reliability of anonymous message systems.”
Cryptographic Approach to “Privacy-Friendly” Tags (2003, background): “Other approaches : There are some other schemes such as [3] [22][13][20].”