Show simple item record

dc.contributor.authorBozkurt, İlker Nadien_US
dc.contributor.authorKaya, Kameren_US
dc.contributor.authorSelçuk, Ali Aydınen_US
dc.coverage.spatialGammarth, Tunisia
dc.date.accessioned2016-02-08T12:27:27Z
dc.date.available2016-02-08T12:27:27Z
dc.date.issued2009-06en_US
dc.identifier.urihttp://hdl.handle.net/11693/28698
dc.descriptionDate of Conference: 21-25 June, 2009
dc.descriptionConference name: International Conference on Cryptology in Africa. AFRICACRYPT 2009: Progress in Cryptology
dc.description.abstractFunction sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation are distributed to the participating parties using a secret sharing scheme (SSS). Several function sharing schemes have been proposed in the literature, with most of them using Shamir secret sharing as the underlying SSS. In this paper, we investigate how threshold cryptography can be conducted with any linear secret sharing scheme and present a function sharing scheme for the RSA cryptosystem. The challenge is that constructing the secret in a linear SSS requires the solution of a linear system, which normally involves computing inverses, while computing an inverse modulo φ(N) cannot be tolerated in a threshold RSA system in any way. The threshold RSA scheme we propose is a generalization of Shoup's Shamir-based scheme. It is similarly robust and provably secure under the static adversary model. At the end of the paper, we show how this scheme can be extended to other public key cryptosystems and give an example on the Paillier cryptosystem. © 2009 Springer Berlin Heidelberg.en_US
dc.language.isoEnglishen_US
dc.source.titleInternational Conference on Cryptology in Africa. AFRICACRYPT 2009: Progress in Cryptologyen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-642-02384-2_11en_US
dc.subjectFunction sharingen_US
dc.subjectLinear secret sharingen_US
dc.subjectThreshold cryptographyen_US
dc.subjectAdversary modelsen_US
dc.subjectPaillier cryptosystemen_US
dc.subjectProvably secureen_US
dc.subjectPublic key cryptosystemsen_US
dc.subjectRSA cryptosystemsen_US
dc.subjectSecret sharingen_US
dc.subjectSecret sharing schemesen_US
dc.subjectSharing schemesen_US
dc.subjectThreshold RSAen_US
dc.subjectThreshold signatureen_US
dc.subjectLinear systemsen_US
dc.subjectPublic key cryptographyen_US
dc.subjectComputer scienceen_US
dc.titlePractical threshold signatures with linear secret sharing schemesen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage167en_US
dc.citation.epage178en_US
dc.identifier.doi10.1007/978-3-642-02384-2_11en_US
dc.publisherSpringer


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record