Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Remark on the threshold RSA signature scheme
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Digital signatures with RSA and other public-key cryptosystems
Communications of the ACM
Communications of the ACM
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Threshold DSS Signatures without a Trusted Party
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Verifiable secret sharing as secure computation
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Verifiable Democracy a Protocol to Secure an Electronic Legislature
EGOV '02 Proceedings of the First International Conference on Electronic Government
Dynamic threshold and cheater resistance for shamir secret sharing scheme
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
| Hi-index | 0.00 |
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.