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: A linear (k,n) secret sharing scheme against cheating based on Shamir's original scheme, which achieves a stronger detection effective than the previous linear secret sharing schemes against cheating.
Abstract: Linear k,n secret sharing scheme with the capability of detecting cheating is considered in this paper. Linear k,n secret sharing scheme is a class of k,n secret sharing, where all the n shares of a secret satisfy a linear relationship. It plays an important role in other cryptographic systems, such as multi-party computation and function sharing schemes. On the other hand, cheating problem in k,n secret sharing is an important issue, such that cheaters dishonest players submit forged shares during secret reconstruction to fool honest players. During decades of research on cheating prevention, vast k,n secret sharing schemes against cheating have been proposed. However, most of these schemes are not linear schemes because it contains redundant information in their shares to achieve cheating detection. Because linear k,n secret sharing is an important primitive in threshold cryptography, linear k,n secret sharing scheme with the capability of cheating detection is also worthwhile to be discussed. In this paper, we propose a linear k,n secret sharing scheme against cheating based on Shamir's original scheme, which possesses the following merits: 1 Our scheme is just a combination of two Shamir's schemes. Therefore, our scheme can be used in other threshold cryptographic systems, which are based on Shamir's scheme. 2 The size of share in the proposed scheme almost reaches its theoretic lower bound in k,n secret sharing with cheating detection. 3 In the phase of cheating detection, only one honest player can detect the cheating from other k - 1 cheaters, which achieves a stronger detection effective than the previous linear secret sharing schemes against cheating. Copyright © 2016 John Wiley & Sons, Ltd.
21 citations
•
TL;DR: A verifiable FHE is proposed, where the receiver can check the validity of ciphertexts and the scheme is one-way secure against chosen plaintext attacks based on the factorization problem of matrices over noncommutative rings.
Abstract: A framework of noise-free symmetric fully homomorphic encryption (FHE) is proposed in this work. Different from the frameworks that are defined over non-commutative groups, our framework is constructed from matrices over noncommutative rings. The scheme is one-way secure against chosen plaintext attacks (OW-CPA) based on the factorization problem of matrices over noncommutative rings as well as the hardness of an overdefined system of multivariate polynomial equations over the given non-commutative algebraic structure. On the basis of this framework, a verifiable FHE is proposed, where the receiver can check the validity of ciphertexts.
21 citations
•
TL;DR: The scheme is end-to-end verifiable and allows for voting over the Internet and guarantees security against malicious hardware and software used by a voter; a voter's computer does not get any knowledge about the voter's choice.
Abstract: We present Scratch, Click & Vote remote voting scheme. The scheme is end-to-end verifiable and allows for voting over the Internet. It guarantees security against malicious hardware and software used by a voter; a voter’s computer does not get any knowledge about the voter’s choice. Moreover, it can blindly change the voter’s ballot with a small probability only.
21 citations
•
21 citations
••
TL;DR: The proposed conjunctive keyword searchable encryption scheme with an authentication mechanism that can efficiently verify the integrity of search results is based on the dynamic searchable symmetric encryption and adopts the Merkle tree and bilinear map accumulator to prove the correctness of set operations.
Abstract: Conjunctive searchable encryption is an efficient way to perform multi-keyword search over encrypted data in cloud storage. However, most existing methods do not take into account the integrity verification of the search result. Moreover, existing integrity verification methods can only verify the integrity of single-keyword search results, which cannot meet the requirements of conjunctive search. To address this problem, we proposed a conjunctive keyword searchable encryption scheme with an authentication mechanism that can efficiently verify the integrity of search results. The proposed scheme is based on the dynamic searchable symmetric encryption and adopts the Merkle tree and bilinear map accumulator to prove the correctness of set operations. It supports conjunctive keyword as input for conjunctive search and gives the server the ability to prove the integrity of the search result to the user. Formal proofs and extensive experiments show that the proposed scheme is efficient, unforgeable and adaptive secure against chosen-keyword attacks.
21 citations