A verifiable secret sharing scheme based on the chinese remainder theorem

Simple item page
dc.citation.epage425en_US
dc.citation.spage414en_US
dc.contributor.authorKaya, Kameren_US
dc.contributor.authorSelçuk, Ali Aydınen_US
dc.coverage.spatialKharagpur, India
dc.date.accessioned2016-02-08T11:36:16Z
dc.date.available2016-02-08T11:36:16Z
dc.date.issued2008-12en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionConference name: Conference on Cryptology in India INDOCRYPT 2008: Progress in Cryptology - INDOCRYPT 2008
dc.descriptionDate of Conference: 14-17 December, 2008
dc.description.abstractIn this paper, we investigate how to achieve verifiable secret sharing (VSS) schemes by using the Chinese Remainder Theorem (CRT). We first show that two schemes proposed earlier are not secure by an attack where the dealer is able to distribute inconsistent shares to the users. Then we propose a new VSS scheme based on the CRT and prove its security. Using the proposed VSS scheme, we develop a joint random secret sharing (JRSS) protocol, which, to the best of our knowledge, is the first JRSS protocol based on the CRT. © 2008 Springer Berlin Heidelberg.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:36:16Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2008en
dc.identifier.doi10.1007/978-3-540-89754-5_32en_US
dc.identifier.urihttp://hdl.handle.net/11693/26802en_US
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-540-89754-5_32en_US
dc.source.titleProgress in Cryptology - Indocrypt 2008 : 9th International Conference on Cryptology in Indiaen_US
dc.subjectAsmuth-Bloom secret sharing schemeen_US
dc.subjectChinese Remainder Theoremen_US
dc.subjectJoint random secret sharingen_US
dc.subjectVerifiabilityen_US
dc.subjectBlooms (metal)en_US
dc.subjectFluorescent screensen_US
dc.subjectSpectrum analyzersen_US
dc.subjectTelevision picture tubesen_US
dc.subjectAsmuth-Bloom secret sharing schemeen_US
dc.subjectChinese Remainder Theoremen_US
dc.subjectRemainder theoremen_US
dc.subjectVisual secret sharing (VSS) schemeen_US
dc.subjectCryptographyen_US
dc.titleA verifiable secret sharing scheme based on the chinese remainder theoremen_US
dc.typeConference Paperen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A verifiable secret sharing scheme based on the chinese remainder theorem.pdf
Size:
221.31 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering