The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2005)
Columbus, Ohio, USA
June 6, 2005 to June 10, 2005
ISSN: 1063-6927
ISBN: 0-7695-2331-5
pp: 815-824
Michael A. Marsh , University of Maryland
Anna Redz , Royal Institute of Technology
Fred B. Schneider , Cornell University
Lidong Zhou , Microsoft Research Silicon Valley
A protocol is given to take an ElGamal ciphertext encrypted under the key of one distributed service and produce the corresponding ciphertext encrypted under the key of another distributed service, but without the plaintext ever becoming available. Each distributed service comprises a set of servers and employs threshold cryptography to maintain its service private key. Unlike prior work, the protocol requires no assumptions about execution speeds or message delivery delays. The protocol also imposes fewer constraints on where and when various steps are performed, which can bring improvements in end-to-end performance for some applications (e.g., a trusted publish/subscribe infrastructure.) Two new building blocks employed — a distributed blinding protocol and verifiable dual encryption proofs — could have uses beyond re-encryption protocols.
Michael A. Marsh, Anna Redz, Fred B. Schneider, Lidong Zhou, "Distributed Blinding for Distributed ElGamal Re-Encryption", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 815-824, 2005, doi:10.1109/ICDCS.2005.24
106 ms
(Ver 3.3 (11022016))