How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
SIAM Journal on Discrete Mathematics
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Verifiable Democracy a Protocol to Secure an Electronic Legislature
EGOV '02 Proceedings of the First International Conference on Electronic Government
A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
Algorithms to Speed Up Computations in Threshold RSA
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Practical Threshold RSA Signatures without a Trusted Dealer
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Improved Methods to Perform Threshold RSA
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Optimal-resilience proactive public-key cryptosystems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Several threshold RSA signature schemes have been proposed, in particular the schemes [4,8] and [20]. Recent research has shown that the earlier schemes [4,8] may be in some cases more “efficient” than these later schemes. Here we describe efficient implementations of threshold RSA schemes as well as further enhancements to improve performance of the Desmedt-Frankel scheme. Our conclusion is that if memory is not an issue there will be situations, for example if one can expect shareholders know who will be participating in the signature generation, that the Desmedt-Frankel scheme is very efficient.