loading...
Distributed Blinding for Distributed ElGamal Re-Encryption
Columbus, Ohio, USA June 06-June 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2005.2425th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lidong Zhou, Microsoft Research Silicon Valley
Michael A. Marsh, University of Maryland
Fred B. Schneider, Cornell University
Anna Redz, Royal Institute of Technology
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.
Citation:
Lidong Zhou, Michael A. Marsh, Fred B. Schneider, Anna Redz, "Distributed Blinding for Distributed ElGamal Re-Encryption," icdcs, pp.815-824, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.