NDLI: On the optimization of bipartite secret sharing schemes

Content Provider	Springer Nature Link
Author	Metcalf Burton, Jessica Ruth Farràs, Oriol Padró, Carles Vázquez, Leor
Copyright Year	2011
Abstract	Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants is divided in two parts, and all participants in each part play an equivalent role. We focus on the search of lower bounds by using a special class of polymatroids that is introduced here, the tripartite ones. We present a method based on linear programming to compute, for every given bipartite access structure, the best lower bound that can be obtained by this combinatorial method. In addition, we obtain some general lower bounds that improve the previously known ones, and we construct optimal secret sharing schemes for a family of bipartite access structures.
Ending Page	271
Page Count	17
Starting Page	255
File Format	PDF
ISSN	09251022
e-ISSN	15737586
Journal	Designs, Codes and Cryptography
Issue Number	2
Volume Number	63
Language	English
Publisher	Springer US
Publisher Date	2011-08-24
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Information and Communication, Circuits Matroids, geometric lattices Data Encryption Multipartite secret sharing Linear programming Polymatroids Data Structures, Cryptology and Information Theory Discrete Mathematics in Computer Science Coding and Information Theory Secret sharing Authentication and secret sharing Cryptography Combinatorics
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Discrete Mathematics and Combinatorics Theoretical Computer Science Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Extending Brickell–Davenport theorem to non-perfect secret sharing schemes

An impossibility result on graph secret sharing

Sharing Multiple Secrets: Models, Schemes and Analysis

A geometric protocol for cryptography with cards

Cheating in Visual Cryptography

Authentication Schemes from Highly Nonlinear Functions

New results and applications for multi-secret sharing schemes

Signcryption schemes with threshold unsigncryption, and applications

On the optimization of bipartite secret sharing schemes

Similar Documents

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Extending Brickell–Davenport theorem to non-perfect secret sharing schemes

An impossibility result on graph secret sharing

Sharing Multiple Secrets: Models, Schemes and Analysis

A geometric protocol for cryptography with cards

Cheating in Visual Cryptography

Authentication Schemes from Highly Nonlinear Functions

New results and applications for multi-secret sharing schemes

Signcryption schemes with threshold unsigncryption, and applications

On the optimization of bipartite secret sharing schemes