Threshold cryptography based on asmuth-bloom secret sharing

Authors:
Kamer Kaya;Ali Aydın Selçuk;Zahir Tezcan
Affiliations:
Department of Computer Engineering, Bilkent University, Ankara, Turkey;Department of Computer Engineering, Bilkent University, Ankara, Turkey;Department of Computer Engineering, Bilkent University, Ankara, Turkey
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 7
Cited 0

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
How to share a secret

Communications of the ACM
Robust threshold DSS signatures

Information and Computation
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Some Recent Research Aspects of Threshold Cryptography

ISW '97 Proceedings of the First International Workshop on Information Security
Practical threshold signatures

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present two novel function sharing schemes, one for the RSA signature and the other for the ElGamal decryption functions, based on the Asmuth-Bloom scheme. To the best of our knowledge, these are the first threshold cryptosystems realized using the Asmuth-Bloom secret sharing. The proposed schemes compare favorably to the earlier function sharing schemes in performance as well as in certain theoretical aspects.