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 条

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

Csirmaz, Laszlo .

DESIGNS CODES AND CRYPTOGRAPHY, 2009, 53 (03) :195-209

[32] User-friendly random-grid-based visual secret sharing for general access structures [J].

Pang, Liaojun ;

Miao, Deyu ;

Lian, Chunfeng .

SECURITY AND COMMUNICATION NETWORKS, 2016, 9 (10) :966-976

[33] Optimal multiple assignment scheme for strongly secure ramp secret sharing schemes with general access structures [J].

Matsumoto, Ryutaroh .

IEICE COMMUNICATIONS EXPRESS, 2015, 4 (11) :317-320

[34] Dynamic hierarchical quantum secret sharing with general access structure [J].

Li, Fulin ;

Chen, Tingyan ;

Zhu, Huihui ;

Zhu, Shixin ;

Pang, Binbin .

QUANTUM INFORMATION PROCESSING, 2023, 22 (08)

[35] Relations Between Secret Sharing and Secret Image Sharing [J].

Yan, Xuehu ;

Li, Jinming ;

Lu, Yuliang ;

Liu, Lintao ;

Yang, Guozheng ;

Chen, Huixian .

SECURITY WITH INTELLIGENT COMPUTING AND BIG-DATA SERVICES, 2020, 895 :79-93

[36] Hypergraph decomposition and secret sharing [J].

Di Crescenzo, Giovanni ;

Galdi, Clemente .

DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) :928-946

[37] Succinct Computational Secret Sharing [J].

Applebaum, Benny ;

Beimel, Amos ;

Ishai, Yuval ;

Kushilevitz, Eyal ;

Liu, Tianren ;

Vaikuntanathan, Vinod .

PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, :1553-1566

[38] Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures [J].

Eriguchi, Reo ;

Kunihiro, Noboru ;

Nuida, Koji .

DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (05) :1751-1778

[39] Progressive Quality Access through Secret Sharing and Data Hiding Scheme [J].

Bhattacharjee, Tapasi ;

Maity, Santi P. ;

Maity, Hirak K. .

2014 FIRST INTERNATIONAL IMAGE PROCESSING, APPLICATIONS AND SYSTEMS CONFERENCE (IPAS), 2014,

[40] 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

← 1 2 3 4 5 →