A Secret Sharing Scheme with General Access Structures and its Applications

2011 ◽  
Vol 3 (4) ◽  
pp. 121-128 ◽  
Author(s):  
Yongxuan Sang ◽  
Jiwen Zeng ◽  
Zhongwen Li ◽  
Lin You
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Access Structures ◽  
Sharing Scheme

scholarly journals DISTRIBUTED TRUST IN ePAYMENTS SYSTEM

2014 ◽  
pp. 87-94
Author(s):  
K. P. Vidya
Keyword(s):  
Elliptic Curve ◽  
Efficient Method ◽  
Secret Sharing ◽  
Discrete Logarithm ◽  
Secret Sharing Scheme ◽  
Central Processor ◽  
Clearing House ◽  
Access Structures ◽  
Sharing Scheme ◽  
Level Zero

In this paper, a secret sharing scheme that is based on the Parallel Pollard rho Attack of the Elliptic Curve Discrete Logarithm Problem (ECDLP) is proposed for hierarchical access structures that can be activated dynamically. The shares of the scheme are distributed across two levels of participants but the reconstruction of the secret takes place at level zero which is the central processor or the trusted party of the scheme. The scheme finds its application in the Payments System of Banks and facilitates the replacement of paper cheques with eCheques. It also provides an efficient method of processing the payments at the Clearing House of Banks.

scholarly journals Threshold Secret Sharing Scheme for Compartmented Access Structures

Cryptography ◽  
2020 ◽  
pp. 438-448
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Access Structures ◽  
Sharing Scheme ◽  
Single Host ◽  
Compartmented Access Structures ◽  
Key Features

In the realm of visual cryptography, secret sharing is the predominant method of transmission and reception of secure data. Most of the (n, n) secret sharing schemes suffer from one common flaw — locking of information when the all- n number of receivers are not available for some reason. This paper proposes a new method of compartmented secret sharing scheme where some threshold number of equally privileged from each compartment can retrieve data. This scheme rules out regeneration of secret image at the single compartment thereby eliminating the danger of misusing secret image. The key features of this scheme are: better visual quality of the recovered image with no pixel expansion; non-requirement of half toning of color images; less computational complexity by reconstructing secret through XORing and simple addition of all share images. This scheme is highly beneficial in applications where data has to be stored securely in a database and in cloud computing to synchronize information passed to different groups or clusters from a single host.

scholarly journals Localizing and excluding quantum information; or, how to share a quantum secret in spacetime

Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 196
Author(s):  
Patrick Hayden ◽  
Alex May
Keyword(s):  
Quantum Information ◽  
Quantum System ◽  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Secret Sharing Scheme ◽  
Access Structures ◽  
Sharing Scheme ◽  
Assembly Tasks ◽  
Quantum Secret Sharing Scheme

When can quantum information be localized to each of a collection of spacetime regions, while also excluded from another collection of regions? We answer this question by defining and analyzing the localize-exclude task, in which a quantum system must be localized to a collection of authorized regions while also being excluded from a set of unauthorized regions. This task is a spacetime analogue of quantum secret sharing, with authorized and unauthorized regions replacing authorized and unauthorized sets of parties. Our analysis yields the first quantum secret sharing scheme for arbitrary access structures for which the number of qubits required scales polynomially with the number of authorized sets. We also study a second related task called state-assembly, in which shares of a quantum system are requested at sets of spacetime points. We fully characterize the conditions under which both the localize-exclude and state-assembly tasks can be achieved, and give explicit protocols. Finally, we propose a cryptographic application of these tasks which we call party-independent transfer.

scholarly journals Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets

2020 ◽  
Vol 88 (9) ◽  
pp. 1893-1907
Author(s):  
Ryutaroh Matsumoto
Keyword(s):  
Secret Sharing ◽  
Explicit Construction ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Access Structures ◽  
Sharing Scheme ◽  
Randomized Encoding

Abstract We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert–Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece–Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.

Sign in / Sign up

Export Citation Format

Share Document