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
TL;DR: This paper proposes a new privacy-aware public auditing mechanism for shared cloud data by constructing a homomorphic verifiable group signature that eliminates the abuse of single-authority power and provides non-frameability.
Abstract: Today, cloud storage becomes one of the critical services, because users can easily modify and share data with others in cloud. However, the integrity of shared cloud data is vulnerable to inevitable hardware faults, software failures or human errors. To ensure the integrity of the shared data, some schemes have been designed to allow public verifiers (i.e., third party auditors) to efficiently audit data integrity without retrieving the entire users’ data from cloud. Unfortunately, public auditing on the integrity of shared data may reveal data owners’ sensitive information to the third party auditor. In this paper, we propose a new privacy-aware public auditing mechanism for shared cloud data by constructing a homomorphic verifiable group signature. Unlike the existing solutions, our scheme requires at least t group managers to recover a trace key cooperatively, which eliminates the abuse of single-authority power and provides nonframeability. Moreover, our scheme ensures that group users can trace data changes through designated binary tree; and can recover the latest correct data block when the current data block is damaged. In addition, the formal security analysis and experimental results indicate that our scheme is provably secure and efficient.
110 citations
17 Aug 2014
TL;DR: Boneh and Freeman as discussed by the authors proposed a homomorphic signature scheme for a class of functions, which allows a client to sign and upload elements of some data set D on a server at any later point, the server can derive a (publicly verifiable) signature that certifies that some y is the result computing some ρ in ρ.
Abstract: A homomorphic signature scheme for a class of functions \(\mathcal{C}\) allows a client to sign and upload elements of some data set D on a server At any later point, the server can derive a (publicly verifiable) signature that certifies that some y is the result computing some \(f\in\mathcal{C}\) on the basic data set D This primitive has been formalized by Boneh and Freeman (Eurocrypt 2011) who also proposed the only known construction for the class of multivariate polynomials of fixed degree d ≥ 1 In this paper we construct new homomorphic signature schemes for such functions Our schemes provide the first alternatives to the one of Boneh-Freeman, and improve over their solution in three main aspects First, our schemes do not rely on random oracles Second, we obtain security in a stronger fully-adaptive model: while the solution of Boneh-Freeman requires the adversary to query messages in a given data set all at once, our schemes can tolerate adversaries that query one message at a time, in a fully-adaptive way Third, signature verification is more efficient (in an amortized sense) than computing the function from scratch The latter property opens the way to using homomorphic signatures for publicly-verifiable computation on outsourced data Our schemes rely on a new assumption on leveled graded encodings which we show to hold in a generic model
109 citations
TL;DR: This paper proposes a new protocol of semi-quantum secret sharing, which utilizes product states instead of entangled states and proves that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice.
Abstract: Boyer et al (2007 Phys. Rev. Lett. 99 140501) proposed a novel idea of semi-quantum key distribution, where a key can be securely distributed between Alice, who can perform any quantum operation, and Bob, who is classical. Extending the ?semi-quantum? idea to other tasks of quantum information processing is of interest and worth considering. In this paper, we consider the issue of semi-quantum secret sharing, where a quantum participant Alice can share a secret key with two classical participants, Bobs. After analyzing the existing protocol, we propose a new protocol of semi-quantum secret sharing. Our protocol is more realistic, since it utilizes product states instead of entangled states. We prove that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice.
109 citations
TL;DR: This paper proposes a scheme named “verifiable searchable encryption with aggregate keys”, which a data owner need only distribute a single aggregate key to other users to selectively share both search and verification privileges over his/her document sets.
108 citations
01 Oct 2020
TL;DR: This work constructs a verifiable delay function (VDF) based on groups of unknown order such as an RSA group, or the class group of an imaginary quadratic field, which is very short, and the verification of correctness is very efficient.
Abstract: We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised systems, such as the generation of trustworthy public randomness in a trustless environment, or resource-efficient blockchains. To construct our VDF, we actually build a trapdoor VDF. A trapdoor VDF is essentially a VDF which can be evaluated efficiently by parties who know a secret (the trapdoor). By setting up this scheme in a way that the trapdoor is unknown (not even by the party running the setup, so that there is no need for a trusted setup environment), we obtain a simple VDF. Our construction is based on groups of unknown order such as an RSA group or the class group of an imaginary quadratic field. The output of our construction is very short (the result and the proof of correctness are each a single element of the group), and the verification of correctness is very efficient.
107 citations