Threshold cryptography based on Asmuth–Bloom secret sharing

Simple item page
dc.citation.epage4160en_US
dc.citation.issueNumber19en_US
dc.citation.spage4148en_US
dc.citation.volumeNumber177en_US
dc.contributor.authorKaya, K.en_US
dc.contributor.authorSelçuk, A. A.en_US
dc.date.accessioned2015-07-28T12:06:12Z
dc.date.available2015-07-28T12:06:12Z
dc.date.issued2007-10-01en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractIn this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosysterns. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography. (c) 2007 Elsevier Inc. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2015-07-28T12:06:12Z (GMT). No. of bitstreams: 1 10.1016-j.ins.2007.04.008.pdf: 215951 bytes, checksum: d9021853a9e7b9f9e7fa54eb6f3fc1cb (MD5)en
dc.identifier.doi10.1016/j.ins.2007.04.008en_US
dc.identifier.issn0020-0255en_US
dc.identifier.urihttp://hdl.handle.net/11693/13405en_US
dc.language.isoEnglishen_US
dc.publisherElsevier Inc.en_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ins.2007.04.008en_US
dc.source.titleInformation Sciencesen_US
dc.subjectThreshold cryptographyen_US
dc.subjectFunction sharing schemesen_US
dc.subjectAsmuth-Bloom secret sharingen_US
dc.subjectRSAen_US
dc.subjectElGamalen_US
dc.subjectPaillieren_US
dc.titleThreshold cryptography based on Asmuth–Bloom secret sharingen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
10.1016-j.ins.2007.04.008.pdf
Size:
210.89 KB
Format:
Adobe Portable Document Format
Download

Collections

Scholarly Publications - Computer Engineering