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.

Practical Verifiable Encryption and Decryption of Discrete Logarithms.

Abstract: This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and Shoup based on Paillier’s decision composite residuosity assumption, along with ecient protocols for verifiable encryption and decryption of discrete logarithms (and more generally, of representations with respect to multiple bases). This is the first verifiable encryption system that provides chosen ciphertext security and avoids inecient cut-and-choose proofs. The presented protocols have numerous applications, including key escrow, optimistic fair exchange, publicly verifiable secret and signature sharing, universally composable commitments, group signatures, and confirmer signatures.

Secret sharing with access structures in a hierarchy

Abstract: We propose a secret sharing scheme with the property of access structures in a hierarchy. We employ the concept of admission tickets to delegate the access right from ancestors to their descendants. Each participant group has an authorized access structure and each access structure has its own secret key. The presented scheme is based on general hierarchies, and may be more suitable for real applications.

Privacy-Preserving Data Storage in CloudUsing Array BP-XOR Codes

Abstract: LDPC codes, LT codes, and digital fountain techniques have received significant attention from both academics and industry in the past few years. By employing the underlying ideas of efficient Belief Propagation (BP) decoding process in LDPC and LT codes, this paper designs the BP-XOR codes and use them to design three classes of secret sharing schemes called BP-XOR secret sharing schemes, pseudo-BP-XOR secret sharing schemes, and LDPC secret sharing schemes. By establishing the equivalence between the edge-colored graph model and degree-two BP-XOR secret sharing schemes, we are able to design novel perfect and ideal $2$ -out-of- $n$ BP-XOR secret sharing schemes. By employing techniques from array code design, we are also able to design other $(n,k)$ threshold LDPC secret sharing schemes. In the efficient (pseudo) BP-XOR/LDPC secret sharing schemes that we will construct, only linear number of XOR (exclusive-or) operations on binary strings are required for both secret distribution phase and secret reconstruction phase. For a comparison, we should note that Shamir secret sharing schemes require $O(n\,\log\, n)$ field operations for the secret distribution phase and $O(n^2)$ field operations for the secret reconstruction phase. Furthermore, our schemes achieve the optimal update complexity for secret sharing schemes. By update complexity for a secret sharing scheme, we mean the average number of bits in the participant's shares that needs to be revised when certain bit of the master secret is changed. The extremely efficient secret sharing schemes discussed in this paper could be used for massive data storage in cloud environments achieving privacy and reliability without employing encryption techniques.

Large-scale Election Based On Blockchain.

Abstract: Based on the blockchain, homomorphic ElGamal encryption and ring signature, an electronic voting scheme based on blockchain is proposed for large-scale voting, which has the properties of decentralization, self-management, non-interactive and free-receipt, furthermore the one-time ring signature ensures the anonymity of the vote trading in the blockchain. The public verifiable billboards guarantee the voting fair, and the miner nodes provides ciphertext ballot counting service makes large-scale voting feasible. Finally, we analysis the security of the blockchain voting system and present the performance in large-scale nodes.

Defining verifiability in e-auction protocols

Abstract: An electronic auction protocol will only be used by those who trust that it operates correctly. Therefore, e-auction protocols must be verifiable: seller, buyer and losing bidders must all be able to determine that the result was correct. We pose that the importance of verifiability for e-auctions necessitates a formal analysis. Consequently, we identify notions of verifiability for each stakeholder. We formalize these and then use the developed framework to study the verifiability of two examples, the protocols due to Curtis et al. and Brandt, identifying several issues.