Robust Threshold DSS Signatures

Bar-Ilan, 1994, Noncryptographic fault-tolerant computing in a constant number of rounds Beaver, 1987 Beaver, 1992, Foundations of secure interactive computing, 576, 377 Ben-Or, 1988, Completeness theorems for noncryptographic fault-tolerant distributed computations Boyd, 1986, Digital multisignatures, 241 Berlekamp, E, and, Welch, L. Error Correction of Algebraic Block Codes, U.S. Patent, 4, 633, 470 Canetti, 1999, Adaptive security for threshold cryptosystems, 1666 Chaum, 1988, Multiparty unconditionally secure protocols Cerecedo, 1993, Efficient and secure multiparty generation of digital signatures based on discrete logarithms, IEICE Trans. Fund., E76-A, 532 Croft, 1989, Public-key cryptography and re-usable shared secrets, 189 De Santis, 1994, How to share a function securely Desmedt, 1988, Society and group oriented cryptography: A new concept, 293, 120 Desmedt, 1994, Threshold cryptography, Europ. Trans. Telecomm., 5, 449, 10.1002/ett.4460050407 Desmedt, 1990, Threshold cryptosystems, 435, 307 Desmedt, 1992, Shared generation of authenticators and signatures, 576, 457 ElGamal, 1985, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Info. Theory, 31, 10.1109/TIT.1985.1057074 Feldman, 1987, A practical scheme for non-interactive verifiable secret sharing Feldman, 1988, An optimal algorithm or synchronous Byzantine agreement Frankel, 1996, Witness-based cryptographic program checking and robust function sharing Gennaro, 1996, Robust threshold DSS signatures, 1070, 354 Gennaro, 1996, Robust and efficient sharing of RSA functions, 1109, 157 Gennaro, 1999, Secure distributed key generation in discrete-log based cryptosystems Goldwasser, 1988, A digital signature scheme secure against adaptive chosen-message attacks, SIAM J. Comput., 17, 281, 10.1137/0217017 Goldwasser, 1989, The knowledge complexity of interactive proof-systems, SIAM J. Comput., 18, 186, 10.1137/0218012 Goldreich, 1987, How to play any mental game Harn, 1994, Group oriented (t, n) digital signature scheme, IEE Proc. Comput. Digital Tech., 141, 10.1049/ip-cdt:19941293 Herzberg, 1995, Proactive secret sharing, or: How to cope with perpetual leakage, 963 Herzberg, 1997, Proactive public-key and signature systems Ingemarsson, 1990, A protocol to set up shared secret schemes without the assistance of a mutually trusted party, 473, 266 Langford, 1995, Threshold DSS signatures without a trusted party, 963, 397, 10.1007/3-540-44750-4_32 Micali, 1992, Secure computation, 576, 392 McEliece, 1981, On sharing secrets and Reed-Solomon codes, Commun. Assoc. Comput. Mach, 24, 583 1991, Technical Report Park, C., and Kurosawa, K.New ElGamal type threshold digital signature scheme, IEICE Trans. Fund.E79-A, 86–93. Pedersen, 1991, Distributed provers with applications to undeniable signatures, 547, 221 Pedersen, 1992, Non-interactive and information-theoretic secure verifiable secret sharing, 576, 129 Pedersen, 1991, A threshold cryptosystem without a trusted party, 547, 522 Rabin, 1998, A simplified approach to threshold and proactive RSA, 1462, 89 Rivest, 1978, A method for obtaining digital signatures and public-key cryptosystems, Commun. Assoc. Comput. Mach., 21, 120 Schnorr, 1991, Efficient signature generation by smart cards, J. Cryptology, 4, 161, 10.1007/BF00196725 Shamir, 1979, How to share a secret, Commun. Assoc. Comput. Mach., 22, 612