Distributed blinding for distributed ElGamal re-encryption

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2005, Pages 815-824

  Zhou, Lidong ^a   Schneider, Fred B ^b   Marsh, Michael A ^c   Redz, Anna ^d  

^a MICROSOFT RESEARCH   (United States)

^b Department of Molecular Biology and Genetics   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

^d ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CRYPTOGRAPHY; NETWORK PROTOCOLS; SERVERS; TELECOMMUNICATION SERVICES; ELECTRONIC PUBLISHING;

BLINDING PROTOCOL; CIPHERTEXT; DISTRIBUTED SERVICE; PLAINTEXT; DISTRIBUTED BLINDING PROTOCOL; ELGAMAL CIPHERTEXT; EXECUTION SPEEDS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 27644532597     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In The First Conference on Computer and Communications Security, pages 62-73. ACM, 1993.
2. G. R. Blakley. Safeguarding cryptographic keys. In Proceedings of the National Computer Conference, 48, pages 313-317. American Federation of Information Processing Societies Proceedings, 1979.
3. M. Blaze, G. Bleumer, and M. Strauss. Divertible protocols and atomic proxy cryptography. In K. Nyberg, editor, Advances in Cryptology - Eurocrypt'98 (Lecture Notes in Computer Science 1403), pages 127-144, Espoo, Finland, May 1998. Springer-Verlag.
4. C. Boyd. Digital multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241-246. Clarendon Press, 1989.
5. C. Cachin. Distributing trust on the Internet. In Proceedings of International Conference on Dependable Systems and Networks (DSN-2001), pages 183-192, Göteborg, Sweden, June 30-July 4 2001. IEEE Computer Society Technical Committee on Fault-Tolerant Computing, IFIP Working Group 10.4 on Dependable Computing and Fault Tolerance, IEEE Computer Society.
6. C. Cachin. An asynchronous protocol for distributed computation of RSA inverses and its applications. In Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 153-162, Boston, MA, USA, July 2003. ACM.
7. C. Cachin and J. A. Poritz. Secure intrusion-tolerant replication on the Internet. In Proceedings of the International Conference on Dependable Systems and Networks (DSN-2002), pages 167-176. IEEE, June 2002.
8. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proceedings of the 30th annual ACM symposium on Theory of Computing, pages 209-218. ACM Press, 1998.
9. D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology: Proceedings of Crypto'82, pages 199-203, 1983.
10. D. Chaum and T. Pedersen. Wallet databases with observers. In E. F. Brickell, editor. Advances in Cryptology - Crypto '92 (Lecture Notes in Computer Science 576), pages 89-105, Santa Barbara, CA USA, August 1992. Springer-Verlag.
11. B. Chor, S. Goldwasser, S. Macali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneous broadcast. In Proceedings of the 26th Symposium on Foundations of Computer Science, pages 335-344, 1985.
12. G. D. Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and non-interactive non-malleable commitment. In Advances in Cryptology - Eurocrypt 2001 (Lecture Notes in Computer Science 2045, pages 40-59. Springer-Verlag, May 2001.
13. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In G. Brassard, editor, Advances in Cryptology - Crypto'89 (Lecture Notes in Computer Science 435), pages 307-315, Santa Barbara, California, U.S.A., August 1990. Springer-Verlag.
14. Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Technical Report ISSE-TR-97-01, George Mason University, July 1997.
15. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
16. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
17. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, pages 427-437, 1987.
18. M. J. Fischer, N. A. Lynch, and M. S. Peterson. Impossibility of distributed consensus with one faulty processor. Journal of the ACM, 32(2):374-382, April 1985.
19. Y. Frankel, P. Gemmel, P. MacKenzie, and M. Yung. Optimal resilience proactive public-key cryptosystems. In Proceedings of the 38th Symposium on Foundations of Com puter Science, pages 384-393, Miami Beach, FL USA, October 20-22 1997. IEEE.
20. Y. Frankel and M. Yung. Cryptosystems robust against "dynamic faults" meet enterprise needs for organizational "change control". In M. K. Franklin, editor, Proceedings of the Third International Conference on Financial Cryptography, FC'99 (Lecture Notes in Computer Science 1648), pages 241-252, Anguilla, British West Indies, Feb 1999. Springer-Verlag.
21. J. A. Garay, R. Gennaro, C. Jutla, and T. Rabin. Secure distributed storage and retrieval. In Proc. 11th International Workshop on Distributed Algorithms (WDAG'97), LNCS (1320), pages 275-289, 1997.
22. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or: How to cope with perpetual leakage. In D. Coppersmith, editor, Advances in Cryptology - Crypto'95 (Lecture Notes in Computer Science 963), pages 457-469, Santa Barbara, California, U.S.A., August 1995. Springer-Verlag.
23. M. Jakobsson. On quorum controlled asymmetric proxy re-encryption. In H. Imai and Y. Zheng, editors, Public Key Cryptography, Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography (PKC'99), volume 1560 of Lecture Notes in Computer Science, pages 112-121, Berlin, Germany, 1999. Springer-Verlag.
24. J. Katz. Efficient and non-malleable proofs of plaintext knowledge and applications. Cryptology ePrint Archive (http://eprint.iacr.org/), 2002. 2002/027.
25. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, 1982.
26. M. Mambo and E. Olamoto. Proxy cryptosystem: Delegation of the power to decrypt ciphertexts. IEICE TRANS. Fundamentals, E80-A(1):54-63, January 1997.
27. M. A. Marsh and F. B. Schneider. CODEX: A robust and secure secret distribution system. IEEE Transactions on Dependable and Secure Computing, 1(1):34-47, January-March 2003.
28. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, pages 51-59, 1991.
29. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
30. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor. Advances in Cryptology - Crypto'91 (Lecture Notes in Computer Science 576), pages 129-140, Santa Barbara, California, U.S.A., August 1992. Springer-Verlag.
31. M. K. Reiter. Distributing trust with the Rampart toolkit. Communications of the ACM, 39(4):71-74, April 1996.
32. M. K. Reiter, M. K. Franklin, J. B. Lacy, and R. N. Wright. The Ω key management service. Journal of Computer Security, 4(4):267-297, 1996.
33. F. B. Schneider and L. Zhou. Distributed trust: Supporting fault-tolerance and attack-tolerance. Technical Report TR 2004-1924, Computer Science Department, Cornell University, Ithaca, NY USA, January 2004.
34. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, November 1979.
35. T. Wu, M. Malkin, and D. Boneh. Building intrusion tolerant applications. In Proceedings of the 8th USENIX Security Symposium, pages 79-91, 1999.
36. L. Zhou, M. A. Marsh, F. B. Schneider, and A. Redz. Distributed blinding for ElGamal re-encryption. Technical Report TR 2004-1920, Cornell University, January 2004.
37. L. Zhou, F. B. Schneider, and R. van Renesse. COCA: A secure distributed on-line certification authority. ACM Transactions on Computer Systems, 20(4):329-368, November 2002.