NDLI: Localised multisecret sharing

Content Provider	Springer Nature Link
Author	Laing, Thalia M. Martin, Keith M. Paterson, Maura B. Stinson, Douglas R.
Copyright Year	2016
Abstract	A localised multisecret sharing scheme is a multisecret sharing scheme for an ordered set of players in which players in the smallest sets who are authorised to access secrets are close together in the underlying ordering. We define threshold versions of localised multisecret sharing schemes, we provide lower bounds on the share size of perfect localised multisecret sharing schemes in an information theoretic setting, and we give explicit constructions of schemes to show that these bounds are tight. We then analyse a range of approaches to relaxing the model that provide trade-offs between the share size and the level of security guarantees provided by the scheme, in order to permit the construction of schemes with smaller shares. We show how these techniques can be used in the context of an application to key distribution for RFID-based supply-chain management motivated by the proposal of Juels, Pappu and Parno from USENIX 2008.
Starting Page	581
Ending Page	597
Page Count	17
File Format	PDF
ISSN	19362447
Journal	Cryptography and Communications
Volume Number	9
Issue Number	5
e-ISSN	19362455
Language	English
Publisher	Springer US
Publisher Date	2016-08-31
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Multisecret sharing Information-theoretic security Ramp schemes RFID Cryptography Authentication and secret sharing Data Structures, Cryptology and Information Theory Coding and Information Theory Communications Engineering, Networks Information and Communication, Circuits Mathematics of Computing
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Networks and Communications Computational Theory and Mathematics

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

Secret sharing schemes for compartmented access structures

Cheating-immune secret sharing schemes from codes and cumulative arrays

An Optimal Multisecret Threshold Scheme Construction

Secret sharing schemes based on graphical codes

Sharing Multiple Secrets: Models, Schemes and Analysis

A kind of three-weight linear codes

Complete weight enumerators of two classes of linear codes

New results and applications for multi-secret sharing schemes

An algebra of arrays and almost perfect watermarks

Localised multisecret sharing

Similar Documents

Secret sharing schemes for compartmented access structures

Cheating-immune secret sharing schemes from codes and cumulative arrays

An Optimal Multisecret Threshold Scheme Construction

Secret sharing schemes based on graphical codes

Sharing Multiple Secrets: Models, Schemes and Analysis

A kind of three-weight linear codes

Complete weight enumerators of two classes of linear codes

New results and applications for multi-secret sharing schemes

An algebra of arrays and almost perfect watermarks

Localised multisecret sharing