Robust and efficient sharing of RSA functions

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

Volumn 1109, Issue , 1996, Pages 157-172

  Gennaro, Rosario ^a   Jarecki, Stanisław ^a   Krawczyk, Hugo ^b   Rabin, Tal ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; EFFICIENCY; NETWORK SECURITY;

CERTIFICATION AUTHORITIES; EFFICIENT PROTOCOLS; ROBUST PROTOCOL; ROBUST THRESHOLD SIGNATURE SCHEME; RSA SIGNATURE SCHEMES; RSA SIGNATURES; THRESHOLD RSA SIGNATURES; UNDENIABLE SIGNATURE;

CRYPTOGRAPHY;

EID: 84947441722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_13     Document Type: Conference Paper

References (25)

1. [BCC88] G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. JCSS, 37(2): 156-189, 1988.
2. [BCDP91] J. Boyar, D, Chaum, I. Damgârd, and T. Pedersen. Convertible undeniable signatures. In A.J. MenezesandS. A. Vanstone,editors, Proc. CRYPTO 90, pages 189-205. Springer- Verlag, 1991. Lecture Notes in Computer Science No. 537.
3. [BK89] M. Blum and S. Kannan. Program correctness checking and the design of programs that check their work. In Proc. of the 21st ACM Symposium on Theory of Computing, 1989.
4. [Boy86] C. Boyd. Digital Multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241-246. Claredon Press, 1986.
5. [BR94] M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Euwcrypt'94,1994.
6. [CA90] David Chaum and Hans Van Antwerpen. Undeniable signatures. In G. Brassard, editor, Proc. CRYPTO 89, pages 212-217. Springer-Verlag, 1990. Lecture Notes in Computer Science No, 435.
7. [Cha90] D. Chaum. Zero-knowledge undeniable signatures. In Proc. EUROCRYPT 90, pages 458-464. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 473.
8. [DDFY94] Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. In Proc. 26th ACM Symp. on Theory of Computing, pages 522-533, Santa Fe, 1994. IEEE.
9. [Des94] Yvo G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449-457, July 1994.
10. [DF90] Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO 89, pages 307-315. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.
11. [DF92] Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 457-469. Springer, 1992. Lecture Notes in Computer Science No. 576.
12. [Fel87] P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proceeding 28th Annual Symposium on the Foundations of Computer Science, pages 427-437. IEEE, 1987.
13. [FGY96] Y. Frankel, P. Gemmell, and M. Yung. Witness-based Cryptographic Program Checking and Robust Function Sharing. To appear in proceedings of STOC96,1996.
14. [GJKR96] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold dss signatures. To appear in Eurocrypt'96, 1996.
15. [GM84] S. GoldwasserandS. Micali. Probabilistic encryption. JCSS, 28(2):270-299, April 1984.
16. [GMR88] Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SÍAMJ. Computing, 17(2):281-308, April 1988.
17. [GMR89] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM.J. Computing, 18(l):186-208, February 1989.
18. [GMW86] O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but the Validity of the Assertion, and a Methodology of Cryptographic Protocol Design. In Proceeding 27th Annual Symposium on the Foundations of Computer Science, pages 174-187. ACM, 1986.
19. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proceeding 19th Annual Symposium on the Theory of Computing, pages 218-229. ACM, 1987.
20. [Gol95] Oded Goldreich. Foundation of Cryptography - Fragments of a Book. Electronic Colloquium on Computational Complexity, February 1995. Available online from http://www.eccc.uni-trier.de/eccc/.
21. [Mic92] Silvio Micali. Fair public-key cryptosystems. In Emest F. Brickell, editor, Proc. CRYPTO 92, pages 113-138. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 740.
22. [Ped91] T. Pedersen, Distributed provers with applications to undeniable signatures. In Euro- crypt'9l, 1991.
23. [Rab94] T. Rabin. Robust Sharing of Secrets When the Dealer is Honest or Faulty. Journal of the ACM, 41(6): 1089-1109,1994.
24. [RB89] T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proceeding 21st Annual Symposium on the Theory of Computing, pages 73-85. ACM, 1989.
25. [Sha79] A. Shamir. How to Share a Secret. Communications of the ACM, 22:612-613,1979.