An Asynchronous Protocol for Distributed Computation of RSA Inverses and its Applications

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 153-162

  Cachin, Christian ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Byzantine agreement; Cryptography; Threshold signatures; Verifiable random functions; Verifiable secret sharing

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; FUNCTIONS; HEURISTIC METHODS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; SECURITY OF DATA; SYNCHRONIZATION;

BYZANTINE AGREEMENT; THRESHOLD SIGNATURES; VERIFIABLE RANDOM FUNCTIONS; VERIFIABLE SECRET SHARING;

NETWORK PROTOCOLS;

EID: 1142268846     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872058     Document Type: Conference Paper

References (29)

1. N. Barić and B. Pfitzmann, "Collision-free accumulators and fail-stop signature schemes without trees," in Proc. EUROCRYPT '97, pp. 480-494, 1997.
2. M. Ben-Or, R. Canetti, and O. Goldreich, "Asynchronous secure computation," in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 52-61, 1993.
3. M. Ben-Or, B. Kelmer, and T. Rabin, "Asynchronous secure computation with optimal resilience," in Proc. 13th ACM Symposium on Principles of Distributed Computing (PODC), pp. 183-192, 1994.
4. C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl, "Asynchronous verifiable secret sharing and proactive cryptosystems," in Proc. 9th ACM Conference on Computer and Communications Security (CCS), pp. 88-97, 2002.
5. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and efficient asynchronous broadcast protocols (extended abstract)," in Proc. CRYPTO 2001, pp. 524-541, Springer, 2001.
6. C. Cachin, K. Kursawe, and V. Shoup, "Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography," in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123-132, 2000.
7. R. Canetti, R. Gennaro, A. Herzberg, and D. Naor, "Proactive security: Long-term protection against break-ins," RSA Laboratories' CryptoBytes, vol. 3, no. 1, 1997.
8. R. Canetti and T. Rabin, "Fast asynchronous Byzantine agreement with optimal resilience," in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42-51, 1993.
9. D. Catalano, R. Gennaro, and S. Halevi, "Computing inverses over a shared secret modulus," in Proc. EUROCRYPT 2000, pp. 190-206, Springer, 2000.
10. B. Chor and C. Dwork, "Randomization in Byzantine agreement," in Randomness and Computation (S. Micali, ed.), vol. 5 of Advances in Computing Research, pp. 443-497, JAI Press, 1989.
11. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, "Verifiable secret sharing and achieving simultaneity in the presence of faults," in Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 383-395, 1985.
12. R. Cramer and V. Shoup, "Signature schemes based on the strong RSA problem," ACM Transactions on Information and System Security, vol. 3, no. 3, pp. 161-185, 2000.
13. Y. Desmedt, "Threshold cryptography," European Transactions on Telecommunications, vol. 5, no. 4, pp. 449-457, 1994.
14. Y. Desmedt and Y. Frankel, "Shared generation of authenticators and signatures," in Proc. CRYPTO '91, pp. 457-469, Springer, 1992.
15. Y. Frankel, P. Gemmell, P. MacKenzie, and M. Yung, "Optimal-resilience proactive public-key cryptosystems," in Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 384-393, 1997.
16. E. Fujiksaki and T. Okamoto, "Statistical zero knowledge protocols to prove modular polynomial relations," in Proc. CRYPTO '97, pp. 16-30, Springer, 1997.
17. R. Gennaro, S. Halevi, and T. Rabin, "Secure hash-and-sign signatures without the random oracle," in Proc. EUROCRYPT '99, pp. 123-139, Springer, 1999.
18. R. Gennaro, T. Rabin, S. Jarecki, and H. Krawczyk, "Robust and efficient sharing of RSA functions," Journal of Cryptology, vol. 13, pp. 273-300, 2000.
19. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," Journal of the ACM, vol. 33, pp. 792-807, Oct. 1986.
20. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM Journal on Computing, vol. 18, pp. 186-208, Feb. 1989.
21. S. Micali, M. Rabin, and S. Vadhan, "Verifiable random functions," in Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 120-130, 1999.
22. M. Naor and O. Reingold, "Number-theoretic constructions of efficient pseudo-random functions," in Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 458-467, 1997.
23. J. B. Nielsen, "A threshold pseudorandom function construction and its applications," in Proc. CRYPTO 2002, pp. 401-416, Springer, 2002.
24. T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in Proc. CRYPTO '91, pp. 129-140, Springer, 1992.
25. M. O. Rabin, "Randomized Byzantine generals," in Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 403-409, 1983.
26. T. Rabin, "A simplified approach to threshold and proactive RSA," in Proc. CRYPTO '98, pp. 89-104, Springer, 1998.
27. M. Reiter, "Secure agreement protocols: Reliable and atomic group multicast in Rampart," in Proc. 2nd ACM Conference on Computer and Communications Security, pp. 68-80, 1994.
28. R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, vol. 21, pp. 120-126, Feb. 1978.
29. V. Shoup, "Practical threshold signatures," in Proc. EUROCRYPT 2000, pp. 207-220, Springer, 2000.