Threshold Cryptography Based on Asmuth-Bloom Secret Sharing

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article , Other literature type 01 Jan 2006 Turkey Publisher:Springer Berlin Heidelberg

Authors: Kamer Kaya; Ali Aydin Selçuk; Zahir Tezcan;

doi: 10.1007/11902140_97

handle: 11693/27265

Threshold Cryptography Based on Asmuth-Bloom Secret Sharing

- Summary
- Subjects
- Metrics

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.

Country

Turkey

Related Organizations

Bilkent University
Turkey

Keywords

Electronic document exchange, Electronic document identification systems, Cryptography, Secret sharing, ElGamal decryption

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average