Distributed blinding for distributed ElGamal re-encryption
2005 (English)In: 25th IEEE International Conference on Distributed Computing Systems, Proceedings, IEEE Computer Society, 2005, 815-824 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE Computer Society, 2005. 815-824 p.
, International Conference on Distributed Computing Systems. Proceedings, ISSN 1063-6927
Blinding protocol, Ciphertext, Distributed service, Plaintext, Constraint theory, Cryptography, Network protocols, Servers, Telecommunication services, Distributed computer systems
Other Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-156556DOI: 10.1109/ICDCS.2005.24ISI: 000230332600077ScopusID: 2-s2.0-27644532597ISBN: 0-7695-2331-5OAI: oai:DiVA.org:kth-156556DiVA: diva2:767597
25th IEEE International Conference on Distributed Computing Systems, 6 June 2005 through 10 June 2005, Columbus, OH
QC 201412022014-12-022014-12-012014-12-02Bibliographically approved