Topic
Verifiable secret sharing
About: Verifiable secret sharing is a research topic. Over the lifetime, 4241 publications have been published within this topic receiving 99569 citations.
Papers published on a yearly basis
Papers
More filters
24 Feb 2003
TL;DR: This paper shows the first instance for which an improvement is possible, and shows instances of multi-secret sharing schemes which achieve this improvement, with respect to both efficiency measures, thus showing that the above bound is tight.
Abstract: A secret sharing scheme is a method for distributing a secret among several parties in such a way that only qualified subsets of the parties can reconstruct it and unqualified subsets receive no information about the secret. A multi-secret sharing scheme is the natural extension of a secret sharing scheme to the case in which many secrets need to be shared, each with respect to possibly different subsets of qualified parties. A multi-secret sharing scheme can be trivially realized by realizing a secret sharing scheme for each of the secrets.In this paper we address the natural questions of whether this simple construction is the most efficient as well, and, if not, how much improvement is possible over it, with respect to both efficiency measures used in the literature; namely, the maximum piece of information and the sum of all pieces of information distributed to all parties. We completely answer these questions, as follows. We show the first instance for which an improvement is possible; we prove a bound on how much improvement is possible with respect to both measures; and we show instances of multi-secret sharing schemes which achieve this improvement, with respect to both measures, thus showing that the above bound is tight.
28 citations
TL;DR: This paper proposed a two-level secret key image encryption scheme, where the first- level secret key is the private symmetric secret key, and the second-levelsecret key is derived from both the first and the plain image by iterating piecewise linear map and Logistic map.
Abstract: Some chaos-based image encryption schemes using plain-images independent secret code streams have weak encryption security and are vulnerable to chosen plaintext and chosen cipher-text attacks. This paper proposed a two-level secret key image encryption scheme, where the first-level secret key is the private symmetric secret key, and the second-level secret key is derived from both the first-level secret key and the plain image by iterating piecewise linear map and Logistic map. Even though the first-level key is identical, the different plain images will produce different second-level secret keys and different secret code streams. The results show that the proposed has high encryption speed, and also can effectively resist the existing cryptanalytic attacks. DOI: http://dx.doi.org/10.11591/telkomnika.v10i6.1599 Full Text: PDF
28 citations
TL;DR: A quantuminformation theoretical model for quantum secret sharing schemes is introduced and a shorter proof of Gottesman's theorem that the size of the shares in aquantum secret sharing scheme must be as large as the secret itself is given.
Abstract: Similarly to earlier models for quantum error correcting codes, we introduce a quantuminformation theoretical model for quantum secret sharing schemes. This model providesnew insights into the theory of quantum secret sharing. By using our model, among otherresults, we give a shorter proof of Gottesman's theorem that the size of the shares in aquantum secret sharing scheme must be as large as the secret itself. Also, we introducedapproximate quantum secret sharing schemes and showed robustness of quantum secretsharing schemes by extending Gottesman's theorem to the approximate case.
28 citations
18 Aug 2009
TL;DR: This paper proposes two modifications of Shamir's secret sharing scheme, and designs a multilevel threshold secret sharing schemes (MTSS), and proves that the proposed scheme is secure.
Abstract: Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate and y-coordinate of a polynomial as private share. In our second modification, dealer uses polynomial with degree larger than the threshold value t to generate shares for a (t, n) threshold scheme. We show that these two modified schemes are ideal and perfect. Using these two modifications, we design a multilevel threshold secret sharing schemes (MTSS). We prove that the proposed scheme is secure.
28 citations
TL;DR: Wang et al. as mentioned in this paper proposed a Verifiable Searchable Encryption Framework (VSEF), which can withstand the inside keyword guessing attacks and achieve verifiable searchability.
Abstract: Searchable encryption (SE) allows cloud tenants to retrieve encrypted data while preserving data confidentiality securely. Many SE solutions have been designed to improve efficiency and security, but most of them are still susceptible to insider Keyword-Guessing Attacks (KGA), which implies that the internal attackers can guess the candidate keywords successfully in an off-line manner. Also in existing SE solutions, a semi-honest-but-curious cloud server may deliver incorrect search results by performing only a fraction of retrieval operations honestly (e.g., to save storage space). To address these two challenging issues, we first construct the basic Verifiable SE Framework (VSEF), which can withstand the inside KGA and achieve verifiable searchability. Based on the basic VSEF, we then present the enhanced VSEF to support multi-keyword search, multi-key encryption and dynamic updates (e.g., data modification, data insertion, and data deletion) at the same time, which highlights the importance of practicability and scalability of SE in real-world application scenarios. We conduct extensive experiments using the Enron email dataset to demonstrate that the enhanced VSEF achieves high efficiency while resisting to the inside KGA and supporting the verifiability of search results.
28 citations