16,367 research outputs found
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
An ideal multi-secret sharing scheme based on minimal privileged coalitions
How to construct an ideal multi-secret sharing scheme for general access
structures is difficult. In this paper, we solve an open problem proposed by
Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342],
namely to design an algorithm of privileged coalitions of any length if such
coalitions exist. Furthermore, in terms of privileged coalitions, we show that
most of the existing multi-secret sharing schemes based on Shamir threshold
secret sharing are not perfect by analyzing Yang et al.'s scheme and Pang et
al.'s scheme. Finally, based on the algorithm mentioned above, we devise an
ideal multi-secret sharing scheme for families of access structures, which
possesses more vivid authorized sets than that of the threshold scheme.Comment: 13page
A secure data outsourcing scheme based on Asmuth – Bloom secret sharing
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Data outsourcing is an emerging paradigm for data management in which a database is provided as a service by third-party service providers. One of the major benefits of offering database as a service is to provide organisations, which are unable to purchase expensive hardware and software to host their databases, with efficient data storage accessible online at a cheap rate. Despite that, several issues of data confidentiality, integrity, availability and efficient indexing of users’ queries at the server side have to be addressed in the data outsourcing paradigm. Service providers have to guarantee that their clients’ data are secured against internal (insider) and external attacks. This paper briefly analyses the existing indexing schemes in data outsourcing and highlights their advantages and disadvantages. Then, this paper proposes a secure data outsourcing scheme based on Asmuth–Bloom secret sharing which tries to address the issues in data outsourcing such as data confidentiality, availability and order preservation for efficient indexing
Ideal Tightly Couple (t,m,n) Secret Sharing
As a fundamental cryptographic tool, (t,n)-threshold secret sharing
((t,n)-SS) divides a secret among n shareholders and requires at least t,
(t<=n), of them to reconstruct the secret. Ideal (t,n)-SSs are most desirable
in security and efficiency among basic (t,n)-SSs. However, an adversary, even
without any valid share, may mount Illegal Participant (IP) attack or
t/2-Private Channel Cracking (t/2-PCC) attack to obtain the secret in most
(t,n)-SSs.To secure ideal (t,n)-SSs against the 2 attacks, 1) the paper
introduces the notion of Ideal Tightly cOupled (t,m,n) Secret Sharing (or
(t,m,n)-ITOSS ) to thwart IP attack without Verifiable SS; (t,m,n)-ITOSS binds
all m, (m>=t), participants into a tightly coupled group and requires all
participants to be legal shareholders before recovering the secret. 2) As an
example, the paper presents a polynomial-based (t,m,n)-ITOSS scheme, in which
the proposed k-round Random Number Selection (RNS) guarantees that adversaries
have to crack at least symmetrical private channels among participants before
obtaining the secret. Therefore, k-round RNS enhances the robustness of
(t,m,n)-ITOSS against t/2-PCC attack to the utmost. 3) The paper finally
presents a generalized method of converting an ideal (t,n)-SS into a
(t,m,n)-ITOSS, which helps an ideal (t,n)-SS substantially improve the
robustness against the above 2 attacks
- …