Show simple item record

dc.contributor.authorKaya, Kameren_US
dc.contributor.authorSelçuk, Ali Aydınen_US
dc.contributor.authorTezcan, Zahiren_US
dc.coverage.spatialIstanbul, Turkey
dc.date.accessioned2016-02-08T11:49:15Z
dc.date.available2016-02-08T11:49:15Z
dc.date.issued2006-11en_US
dc.identifier.urihttp://hdl.handle.net/11693/27265
dc.descriptionDate of Conference: 1-3 November, 2006
dc.descriptionConference name:21th International Symposium on Computer and Information Sciences ISCIS 2006: Computer and Information Sciences
dc.description.abstractIn 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. © Springer-Verlag Berlin Heidelberg 2006.en_US
dc.language.isoEnglishen_US
dc.source.title21th International Symposium on Computer and Information Sciences, ISCIS 2006en_US
dc.relation.isversionofhttps://doi.org/10.1007/11902140_97
dc.subjectElectronic document exchangeen_US
dc.subjectElectronic document identification systemsen_US
dc.subjectElGamal decryptionen_US
dc.subjectSecret sharingen_US
dc.subjectCryptographyen_US
dc.titleThreshold cryptography based on asmuth-bloom secret sharingen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineering
dc.citation.spage935en_US
dc.citation.epage942en_US
dc.identifier.doi10.1007/11902140_97
dc.publisherSpringeren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record