Computing inverses over a shared secret modulus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1807, Issue , 2000, Pages 190-206

  Catalano, Dario ^a   Gennaro, Rosario ^b   Halevi, Shai ^b  

^a UNIVERSITY OF CATANIA   (Italy)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BASIC PROTOCOLS; EFFICIENT PROTOCOLS; EULER FUNCTION; FOLLOWING PROBLEM; MODULAR EXPONENTIATIONS; ROBUST PROTOCOL; SHARED SECRETS; SIGNATURE SCHEME;

COMPUTATION THEORY;

EID: 84948954120     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_14     Document Type: Conference Paper

References (24)

1. N. Barić, and B. Pfitzmann. Collision-free accumulators and Fail-stop signature schemes without trees. In Advances in Cryptology-Eurocrypt ’97, LNCS vol. 1233, Springer, 1997, pages 480-494.
2. J. Bar-Ilan, and D. Beaver. Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds. In Proceedings of the ACM Symposium on Principles of Distributed Computation, pp.201-209, 1989.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. 20th ACM Symposium on the Theory of Computing, pp.1-10, ACM Press, 1988.
4. E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.
5. D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In Advances in Cryptology-Crypto ’97, LNCS vol. 1294, Springer, 1997, pages 425-439. Extended version available from http://crypto.stanford.edu/~dabo/pubs.html
6. R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Adaptive Security for Threshold Cryptosystems. In Advances in Cryptology-Crypto ’99, LNCS vol. 1666, Springer, 1999, pages 98-115.
7. D. Catalano and R. Gennaro. New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications. In Advances in Cryptology-Crypto ’98, LNCS vol. 1462, Springer, 1998, pages 105-120.
8. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. 20th ACM Symposium on the Theory of Computing, pp.11-19, ACM Press, 1988.
9. R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. To appear in the Proceedings of the 6th ACM Conference in Computer and Communication Security, 1999.
10. Y. Desmedt. Society and group oriented cryptography: A new concept. In Carl Pomerance, editor, Advances in Cryptology-CRYPTO’87, Lecture Notes in Computer Science Vol. 293, pp. 120-127, Springer-Verlag, 1988.
11. Y.G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449-457, July 1994.
12. Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Optimal Resilience Proactive Public-Key Cryptosystems. 38th IEEE Symposium on the Foundations of Computer Science, pp.384-393, IEEE Computer Society Press, 1997.
13. Y. Frankel, P. Gemmell, and M. Yung. Witness-based Cryptographic Program Checking and Robust Function Sharing. 28th ACM Symposium on the Theory of Computing, pp.499-508, ACM Press, 1996.
14. Y. Frankel, P. Mackenzie, and M. Yung. Robust Efficient Distributed RSA-Key Generation. In STOC 1998, pp.663-672.
15. E. Fujisaki and T. Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology-Crypto ’97, LNCS vol. 1294, Springer, 1997, pages 16-30.
16. P. Gemmell. An Introduction to Threshold Cryptography. RSA Laboratories CryptoBytes, Vol.2, No.3, Winter 1997.
17. R. Gennaro, S. Halevi and T. Rabin. Secure Hash-and-Sign Signatures without the Random Oracle. In Advances in Cryptology-Eurocrypt ’99, LNCS vol. 1592, Springer, 1999, pages 123-139.
18. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and Efficient sharing of RSA functions. Crypto’96, pp.157-172, Lecture Notes in Computer Science vol.1109, Springer-Verlag, 1996.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. 19th ACM Symposium on Theory of Computing, pp.218-229, ACM Press, 1987.
20. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. Crypto’91, pp.129-140, Lecture Notes in Computer Science vol.576, Springer-Verlag, 1992.
21. T. Rabin. A Simplified Approach to Threshold and Proactive RSA. Crypto’98, pp.89-104, Lecture Notes in Computer Science vol.1462, Springer-Verlag, 1998.
22. R. Rivest, A. Shamir and L. Adelman. A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM, 21 (1978), pp. 120-126
23. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons. 1986.
24. M. Sudan. Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Lecture Notes in Computer Science, vol.1001, Springer-Verlag, 1995.