Abstract Claims Description Full Text

Abstract

A multi-step digital signature system and method is provided having a distributed root certifying authority 20. Messages received at the root certifying authority 20 are distributed to root certifying authority members 22-30 who attach partial signatures to the message using root key fragments. In the system and method provided, the system adapts to system events such as the addition or removal of key fragment holders, the need to modify key fragments, etc., by changing key fragments.

Other References

• Yvo G. Desmedt, "Threshold Cryptography", Jul./Aug. 1994
• Ham, "Group-oriented (t,n) threshold digital signature scheme and digital multisignature", IEE Proc. Comput. Digit. Tech. vol. 141, No. 5, Sep. 1994, pp. 307-313
• Colin Boyd, "Some Applications of Multiple Key Ciphers" (undated)
• "Threshold Hashing and Signing", Extended Abstract, (undated)
• Y. Frankel, "A practical protocol for large group oriented networks", Advances in Cryptology, Proc. of Eurocrypt '89 (Lecture Notes in Computer Science 434)(1990), J.J. Quisgater and J. Vandewalle, Es. Springer-Verlag pp. 56-61
• A. Shamir, "How to share a secret", Commun. ACM 22 (1979) 612-613
• A. De Santis et al, "How to share a function securely"
• Y. Desmedt, "Threshold Cryptosystems"
• R.A. Croft et al, "Public-Key Cryptography and Re-Usable Shared Secrets", Cryptography and coding, 1986, pp. 189-201
• C. Boyd, "Digital Multisignatures", Cryptography and coding, 1986, pp. 241-246
• B. Blakley et al, "Threshold Schemes with Disenrollment", 1994
• Desmedt et al, "Shared Generation of Authenticators and Signatures", Lecture Notes in Computer Science 576, Advances in Cryptology--Crypto '91, 1991, pp. 457-469
• Li et al, "Remark on the Threshold RSA Signature Scheme", Lecture Notes in Computer Science 773, Advances in Cryptology -Crypto '93, 13th Annual International Cryptology Conference, Santa Barbara, California, Aug. 1993, pp. 4313-4419
• Pedersen, "A Threshold Cryptosystem Without a Trusted Party", Lecture Notes in Computer Science 547, Advances in Cryptology -Eurocrypt '91, Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, Apr. 1991, pp. 522-526
• Chang et al, "A New Generalized Group-Oriented Cryptoscheme Without Trusted Centers", IEEE Journal on Selected Areas of Communications, Jun. 1993, pp. 725-729, vol. 11, No. 5
• Frankel et al, "Non-existence of Homorphic General Sharing Schemes for Some Key Spaces", pp. 549-557
• Pedersen, "Distributed Provers with Applications to Undeniable Signatures", Aarhus University, Computer Science Department, Ny Munkegade, Arhus, Denmark, pp. 221-242
• Reiter et al, "How to Securely Replicate Services", ACM Transactions on Programming Languages and Systems, vol. 16, No. 3, May 1991, pp. 987-1009
• Desmedt et al, "Homorphic Zero-Knowledge Threshold Schemes Over Any Finite Abelian Group", SIAM J. Disc Math, vol. 7, No. 4, pp. 667-679, Nov. 199