The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Secret Sharing with k-Dimensional Access Structure
|
|
Author(s): Guojun Wang (Central South University, China), Yirong Wu (Central South University, China), Geyong Min (University of Bradford, UK)and Ronghua Shi (Central South University, China)
Copyright: 2009
Pages: 10
Source title:
Handbook of Research on Secure Multimedia Distribution
Source Author(s)/Editor(s): Shiguo Lian (SAMI Lab, France Telecom R&D Beijing, China)and Yan Zhang (Simula Research Laboratory, Norway)
DOI: 10.4018/978-1-60566-262-6.ch011
Purchase
|
Abstract
Secret sharing aims at distributing and sharing a secret among a group of participants efficiently. In this chapter, we propose a plane-based access structure for secret sharing. Specifically, if any two among a set of three participants in a graph contain an edge, these participants constitute a prohibited structure which is not able to recover the master key. Otherwise, the set of three participants constitute an access structure which can recover the master key. Subsequently, we extend the plane-based scheme and propose a generic k-dimensional secret sharing scheme. Finally, we analyze the performance of the proposed scheme and reveal its advantages compared to existing schemes.
Related Content
|
Nithin Kalorth, Vidya Deshpande.
© 2024.
7 pages.
|
|
Nitesh Behare, Vinayak Chandrakant Shitole, Shubhada Nitesh Behare, Shrikant Ganpatrao Waghulkar, Tabrej Mulla, Suraj Ashok Sonawane.
© 2024.
24 pages.
|
|
T.S. Sujith.
© 2024.
13 pages.
|
|
C. Suganya, M. Vijayakumar.
© 2024.
11 pages.
|
|
B. Harry, Vijayakumar Muthusamy.
© 2024.
19 pages.
|
|
Munise Hayrun Sağlam, Ibrahim Kirçova.
© 2024.
19 pages.
|
|
Elif Karakoç Keskin.
© 2024.
19 pages.
|
|
|