10,802 research outputs found
Efficient Multi-Party Quantum Secret Sharing Schemes
In this work, we generalize the quantum secret sharing scheme of Hillary,
Bu\v{z}ek and Berthiaume[Phys. Rev. A59, 1829(1999)] into arbitrary
multi-parties. Explicit expressions for the shared secret bit is given. It is
shown that in the Hillery-Bu\v{z}ek-Berthiaume quantum secret sharing scheme
the secret information is shared in the parity of binary strings formed by the
measured outcomes of the participants. In addition, we have increased the
efficiency of the quantum secret sharing scheme by generalizing two techniques
from quantum key distribution. The favored-measuring-basis Quantum secret
sharing scheme is developed from the Lo-Chau-Ardehali technique[H. K. Lo, H. F.
Chau and M. Ardehali, quant-ph/0011056] where all the participants choose their
measuring-basis asymmetrically, and the measuring-basis-encrypted Quantum
secret sharing scheme is developed from the Hwang-Koh-Han technique [W. Y.
Hwang, I. G. Koh and Y. D. Han, Phys. Lett. A244, 489 (1998)] where all
participants choose their measuring-basis according to a control key. Both
schemes are asymptotically 100% in efficiency, hence nearly all the GHZ-states
in a quantum secret sharing process are used to generate shared secret
information.Comment: 7 page
An Epitome of Multi Secret Sharing Schemes for General Access Structure
Secret sharing schemes are widely used now a days in various applications,
which need more security, trust and reliability. In secret sharing scheme, the
secret is divided among the participants and only authorized set of
participants can recover the secret by combining their shares. The authorized
set of participants are called access structure of the scheme. In Multi-Secret
Sharing Scheme (MSSS), k different secrets are distributed among the
participants, each one according to an access structure. Multi-secret sharing
schemes have been studied extensively by the cryptographic community. Number of
schemes are proposed for the threshold multi-secret sharing and multi-secret
sharing according to generalized access structure with various features. In
this survey we explore the important constructions of multi-secret sharing for
the generalized access structure with their merits and demerits. The features
like whether shares can be reused, participants can be enrolled or dis-enrolled
efficiently, whether shares have to modified in the renewal phase etc., are
considered for the evaluation
Fourier-based Function Secret Sharing with General Access Structure
Function secret sharing (FSS) scheme is a mechanism that calculates a
function f(x) for x in {0,1}^n which is shared among p parties, by using
distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the
function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017
observed that any function f can be described as a linear combination of the
basis functions by regarding the function space as a vector space of dimension
2^n and gave new FSS schemes based on the Fourier basis. All existing FSS
schemes are of (p,p)-threshold type. That is, to compute f(x), we have to
collect f_i(x) for all the distributed functions. In this paper, as in the
secret sharing schemes, we consider FSS schemes with any general access
structure. To do this, we observe that Fourier-based FSS schemes by Ohsawa et
al. are compatible with linear secret sharing scheme. By incorporating the
techniques of linear secret sharing with any general access structure into the
Fourier-based FSS schemes, we show Fourier-based FSS schemes with any general
access structure.Comment: 12 page
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model
We construct new leakage-resilient signature schemes. Our schemes remain unforgeable against an adversary leaking arbitrary (yet bounded) information on the entire state of the signer (sometimes known as fully leakage resilience), including the random coin tosses of the signing algorithm. The main feature of our constructions is that they offer a graceful degradation of security in situations where standard existential unforgeability is impossible
Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic Eraser
The Algebraic Eraser (AE) is a public key protocol for sharing information
over an insecure channel using commutative and noncommutative groups; a
concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP).
In this paper, we describe how to choose data in CBKAP to thwart an attack by
Kalka--Teicher--Tsaban
- …