Please use this identifier to cite or link to this item:
|Title:||Access structures of elliptic secret sharing schemes||Authors:||Chen, Hao
|Keywords:||DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory||Issue Date:||2008||Source:||Chen, H., Ling, S., & Xing, C. (2008). Access Structures of Elliptic Secret Sharing Schemes. IEEE Transactions on Information Theory, 54(2), 850-852.||Series/Report no.:||IEEE transactions on information theory||Abstract:||It is a central problem in secret sharing to understand the access structures of secret sharing schemes. In Chen and Kramer, secret sharing schemes from algebraic-geometric codes and their applications in secure multiparty computation were proposed and studied. For any given finite field , these secret sharing schemes are ideal ramp secret sharing schemes and allow arbitrarily many players. In this correspondence, we give the access structures explicitly for the elliptic secret sharing schemes from algebraic-geometric (AG) codes associated with elliptic curves. Based on higher degree rational points on elliptic curves, we also construct some nonideal secret sharing schemes with weighted threshold structures.||URI:||https://hdl.handle.net/10356/96429
|ISSN:||0018-9448||DOI:||http://dx.doi.org/10.1109/TIT.2007.913508||Rights:||© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TIT.2007.913508].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Files in This Item:
|61. Access structures of elliptic secret sharing schemes.pdf||199.3 kB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.