Secret sharing on regular bipartite access structures

被引：0

作者：

Gyarmati, Mate ^{[1
]}

机构：

[1] Eotvos Lorand Univ, Dept Computeralgebra, Budapest, Hungary

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2023年 / 91卷 / 05期

关键词：

Secret sharing; Bipartite access structures; Information ratio; Shannon-complexity; SCHEMES; GRAPHS;

D O I：

10.1007/s10623-023-01187-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Bipartite secret sharing schemes realize access structures in which the participants are divided into two parts, and all the participants in the same part play an equivalent role. Such a bipartite structure can be described by the collection of its minimal points. The complexity of a scheme is the ratio between the maximum share size given to the participants and the secret size, and the Shannon complexity of a structure is the best lower bound provided by the entropy method. Within this work, we compute the Shannon complexity of regular bipartite structures and provide optimal constructions for some bipartite structures defined by 2 and 3 points.

引用

页码：1951 / 1971

页数：21

共 50 条

[41] A Universal Secret Sharing Scheme with General Access Structure Based on CRT [J].

Meng, Keju ;

Miao, Fuyou ;

Yu, Yue ;

Lu, Changbin .

2018 17TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (IEEE TRUSTCOM) / 12TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING (IEEE BIGDATASE), 2018, :142-148

[42] The optimal linear secret sharing scheme for any given access structure [J].

Chunming Tang ;

Shuhong Gao ;

Chengli Zhang .

Journal of Systems Science and Complexity, 2013, 26 :634-649

[43] THE OPTIMAL LINEAR SECRET SHARING SCHEME FOR ANY GIVEN ACCESS STRUCTURE [J].

TANG Chunming ;

GAO Shuhong ;

ZHANG Chengli .

Journal of Systems Science & Complexity, 2013, 26 (04) :634-649

[44] Multi-secret sharing scheme based on the general access structure [J].

Pang, Liaojun ;

Jiang, Zhengtao ;

Wang, Yumin .

Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2006, 43 (01) :33-38

[45] A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure [J].

Alam, Irfan ;

Alali, Amal S. ;

Ali, Shakir ;

Asri, Muhammad S. M. .

AXIOMS, 2024, 13 (08)

[46] PAPER Special Section on Cryptography and Information Security Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures with Application to Symmetric PIR [J].

Eriguchi, Reo ;

Kunihiro, Noboru ;

Nuida, Koji .

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (03) :263-271

[47] An Approach for Secret Sharing Using Randomised Visual Secret Sharing [J].

Dixit, Shubhra ;

Jain, Deepak Kumar ;

Saxena, Ankita .

2014 FOURTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT), 2014, :847-850

[48] Natural Generalizations of Threshold Secret Sharing [J].

Farras, Oriol ;

Padro, Carles ;

Xing, Chaoping ;

Yang, An .

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2011, 2011, 7073 :610-+

[49] An impossibility result on graph secret sharing [J].

László Csirmaz .

Designs, Codes and Cryptography, 2009, 53 :195-209

[50] Secret sharing on large girth graphs [J].

Csirmaz, Laszlo ;

Ligeti, Peter .

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (03) :399-410

← 1 2 3 4 5 →