Abstract
Digital signature is a breakthrough of modern cryptographic systems. A (t, n) threshold digital signature allows every set of cardinality t or more (out-of n) co-signers to authenticate a message. In almost all existing threshold digital signatures the threshold parameter t is fixed. There are applications, however, in which the threshold parameter needs to be changed from time to time. This paper considers such a scenario, in order to discuss relevant problems, and proposes a model that solves the related problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Benaloh, “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret,” in Advances in Cryptology-Proceedings of CRYPTO’ 86 (A. Odlyzko, ed.), vol. 263 of Lecture Notes in Computer Science, pp. 251–260, Springer-Verlag, 1987.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorem for Non-Cryptographic Fault-Tolerant Distributed Computation,” in 20th Annual Symposium on the Theory of Computing (STOC), pp. 1–10, 1988.
G. Blakley, “Safeguarding cryptographic keys,” in Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317, 1979.
C. Boyd, “Digital Multisignatures,” in Cryptography and Coding (H. Beker and F. Piper, eds.), pp. 241–246, Clarendon Press, 1989.
D. Denning, “Digital Signatures with RSA and Other Public-Key Cryptosystems,” Communications of the ACM, vol. 27, no. 4, pp. 388–392, 1984.
Y. Desmedt and Y. Frankel, “Shared generation of authenticators and signatures,” in Advances in Cryptology-Proceedings of CRYPTO’ 91 (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 457–469, Springer-Verlag, 1992.
Y. Desmedt and S. Jajodia, “Redistributing secret shares to new access structures and its applications,” tech. rep., George Mason University, ISS-TR-97-01, ftp://isse.gmu.edu/pub/techrep/97_01i_jajodia.ps.gz, 1997.
Y. Desmedt and B. King. Verifiable Democracy. In Secure Information Networks, IFIP TC6/TC11 Joint Working Conference on Communications and Multimedia Security (CMS’99), pages 53–70. Kluwer Academic Publishers, September 1999.
R. Gennaro and S. Micali, “Verifiable Secret Sharing as Secure Computation,” in Advances in Cryptology-Proceedings of EUROCRYPT’ 95 (L. Guillou and J.-J. Quisquater, eds.), vol. 921 of Lecture Notes in Computer Science, pp. 168–182, Springer-Verlag, 1995.
L. Harn, “Group-oriented (t, n) threshold digital signature scheme and digital multisignature,” IEE Proc.-Comput. Digit. Tech., vol. 141, pp. 307–313, Sept. 1994.
P. Horster, M. Michels, and H. Petersen, “Meta-Multisignature schemes based on the discrete logarithm problem,” in Information Security-the Next Decade, (J. H. Eloff and S. H. Solms, eds.), IFIP/Sec’ 95, pp. 128–142, Proceedings of IFIP TC11 eleventh international conference on information security, Chapman and Hall, 1995.
S. Langford, “Threshold DSS Signatures without a Trusted Party,” in Advances in Cryptology-Proceedings of CRYPTO’ 95 (D. Coppersmith, ed.), vol. 963 of Lecture Notes in Computer Science, pp. 397–409, Springer-Verlag, 1995.
M. Reiter, “Secure Agreement Protocols: reliable and atomic group multicast in Rampart,” in Proceedings of the 2nd ACM Conference on Computer and Communications Security, pp. 68–80, 1994.
C. Li, T. Hwang, and N. Lee, “Threshold-Multisignature Schemes where Suspected Forgery Implies Traceability of Adversarial Shareholders,” in Advances in Cryptology-Proceedings of EUROCRYPT’ 94 (A. Santis, ed.), vol. 950 of Lecture Notes in Computer Science, pp. 194–204, Springer-Verlag, 1995.
C. Li, T. Hwang, and N. Lee, “Remark on the Threshold RSA Signature Scheme,” in Advances in Cryptology-Proceedings of CRYPTO’ 93 (D. Stinson, ed.), vol. 773 of Lecture Notes in Computer Science, pp. 413–419, Springer-Verlag, 1994.
C. Park and K. Kurosawa, “New ElGamal Type Threshold Digital Signature Scheme,” IEICE Trans. Fundamentals, vol. E79-A, pp. 86–93, Jan. 1996.
T. Pedersen, “Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing,” in Advances in Cryptology-Proceedings of CRYPTO’ 91 (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 129–140, Springer-Verlag, 1992.
M. Stadler, “Publicly Verifiable Secret Sharing,” in Advances in Cryptology-Proceedings of EUROCRYPT’ 96 (U. Maurer, ed.), vol. 1070 of Lecture Notes in Computer Science, pp. 190–199, Springer-Verlag, 1996.
A. Shamir, “How to Share a Secret,” Communications of the ACM, vol. 22, pp. 612–613, Nov. 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghodosi, H., Pieprzyk, J. (2001). Democratic Systems. In: Varadharajan, V., Mu, Y. (eds) Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol 2119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47719-5_31
Download citation
DOI: https://doi.org/10.1007/3-540-47719-5_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42300-3
Online ISBN: 978-3-540-47719-8
eBook Packages: Springer Book Archive