Robust threshold DSS signatures

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

Volumn 1070, Issue , 1996, Pages 354-371

  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

COMPUTATION THEORY; CRYPTOGRAPHY;

DIGITAL SIGNATURE STANDARD; ELGAMAL; PARAMETER T; ROBUSTNESS PROPERTIES; SYSTEM AVAILABILITY; TRUSTED PARTY;

NETWORK SECURITY;

EID: 84947926543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_31     Document Type: Conference Paper

References (32)

1. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. InProc. 20th ACM Symp. on Theory of Computing, pages 1-10,1988.
2. [Boy86] C. Boyd. Digital Multisignatures. In H. Baker and F. Piper, editors,Cryptography and Coding, pages 241-246. Claredon Press, 1986.
3. [BW] E. Berlekamp and L. Welch, Error correction of algebraic block codes. US Patent 4,633,470.
4. [CCD88] D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. InProc. 20th ACM Symp. on Theory of Computing, pages 11-19, 1988.
5. [Cha90] D. Chaum. Zero-knowledge undeniable signatures. InProc. EUROCRYPT90. pages 458-464. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 473.
6. [DDFY94] Alredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. InProc. 26th ACM Symp. on Theory of Computing, pages 522- 533, Santa Fe, 1994.
7. [Des88] Yvo Desmedt. Society and group oriented cryptography: A new concept. In Carl Pomerance, editor,Proc. CRYPTO87, pages 120-127. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 293.
8. [Des94] Yvo G. Desmedt. Threshold cryptography.European Transactions on Telecommunications, 5(4):449-457, July 1994.
9. [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.
10. [DF92] Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor,Proc. CRYPTO 91, pages 457-469. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 576.
11. [E1G85] T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms.IEEE Trans. Info. Theory, IT 31, 1985.
12. [Fel87] P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. InProc. 28th IEEE Symp. on Foundations of Comp. Science, pages 427-437,1987.
13. [FGY96] Y. Frankel, P. Gemmel, and M. Yung. Witness-based cryptographic program checking and robust function sharing. To appear in proceedings of STOC96, 1996.
14. [FM88] P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. InProc. 20th ACM Symp. on Theory of Computing, pages 148-161, 1988.
15. [fST91 ] National Institute for Standards and Technology. Digital Signature Standard (DSS). Technical Report 169, August 30 1991.
16. [Gen96] Rosario Gennaro. Theory and practice of verifiable secret sharing. Ph.D. thesis, Massachusetts Institute of Technology, to appear, 1996.
17. [GJKR96] Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. Robust and efficient sharing of rsa functions, manuscript, 1996.
18. [GMR88] Shafì Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks.SIAMJ. Computing, 17(2):281-308, April 1988.
19. [GMR89] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems.SIAM. J. Computing, 18(1): 186-208, February 1989.
20. [Har94] L. Ham. Group oriented (t,n) digital signature scheme.IEEE Proc..- Comput.Digit.Tech, 141(5), Sept 1994.
21. + 95] Amir Herzberg, Markus Jakobson, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung. Proactive proactive public key and signature systems, manuscript, 1995.
22. [HJKY95] Amir Ilerzberg, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung. Proactive secret sharing, or: How to cope with perpetual leakage. InProc. CRYPTO 95. SpringerVerlag, August 1995. Lecture Notes in Computer Science No. 963.
23. [HPM94] P. Hörster, H. Petersen, and M. Michels. Meta-elgamal signatures schemes. In2nd ACM Conference on Computer and Communications Security, pages 96-107, 1994.
24. [Lan95] S. Langford. Threshold dss signatures without a trusted party. InCrypto'95, pages 397-409. Springer-Verlag, 1995. Lecture Notes in Computer Science No. 963.
25. [MR92] S. Micali and P. Rogaway. Secure computation. In J. Feigenbaum, editor,Proc. CRYPTO 91, pages 392-404. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 576.
26. [MS81] R. McEliece and D. Sarwate. On sharing secrets and reed-solomon codes.Communications of the ACM, 24(9):583-584, September 1981.
27. [NR94] K. Nyberg and R. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. InProc. EUROCRYPT 94, pages 175-190, 1994.
28. [Ped91a] T. Pedersen. Distributed provers with applications to undeniable signatures. InProc. EUROCRYPT 91, 1991.
29. [Ped91b] T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. InProc. CRYPTO 91, pages 129-140, 1991.
30. [Rab95] M. Rabin. A Simplification Approach to Distributed Multiparty Computations, personal communication, 1995.
31. [Sch91 ] C. P. Schnorr. Efficient signature generation by smart cards.Journal of Cryptology, 4:161-174,1991.
32. [Sha79] A. Shamir. How to Share a Secret.Communications of the ACM, 22:612-613, 1979.