scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
01 Sep 1999
TL;DR: The proposed scheme provides efficient solutions against cheat by either the dealer or a participant, and outperforms (t, n) VMSS schemes against cheating by participants devised by Ham and Chen et al.
Abstract: A new (t, n) threshold verifiable multisecret sharing ((t, n) VMSS) scheme, based on the intractability of the factorisation and the discrete logarithm modulo a large composite problems, is proposed in which the dealer can freely give any set of multiple secrets for sharing, and the shadow held by the participant is not only reusable but also verifiable. The proposed scheme provides efficient solutions against cheating by either the dealer or a participant, and outperforms (t, n) VMSS schemes against cheating by participants devised by Ham and Chen et al.

36 citations

Proceedings ArticleDOI
05 Dec 2017
TL;DR: All identities created using VeidBlock approach are verifiable and anonymous therefore it preserves user's privacy in verification and authentication phase.
Abstract: Blockchain and verifiable identities have a lot of potential in future distributed software applications e.g. smart cities, eHealth, autonomous vehicles, networks, etc. In this paper, we proposed a novel technique, namely VeidBlock, to generate verifiable identities by following a reliable authentication process. These entities are managed by using the concepts of blockchain ledger and distributed through an advance mechanism to protect them against tampering. All identities created using VeidBlock approach are verifiable and anonymous therefore it preserves user's privacy in verification and authentication phase. As a proof of concept, we implemented and tested the VeidBlock protocols by integrating it in a SDN based infrastructure. Analysis of the test results yield that all components successfully and autonomously performed initial authentication and locally verified all the identities of connected components.

36 citations

Journal ArticleDOI
TL;DR: This paper proposes a strong (n, t, n) VSS which is more efficient than Harn and Lin's VSS and a multi-secret sharing scheme (MSS) to allow shareholders to share n-t+1 secrets.

36 citations

Proceedings Article
01 Jan 2019
TL;DR: In this paper, shared, verifiable database tables are introduced, a new abstraction for trusted data sharing in the cloud.
Abstract: In this paper we introduce shared, verifiable database tables, a new abstraction for trusted data sharing in the cloud.

36 citations

Posted Content
TL;DR: The proposed system make use of bitwise representation of votes and only the shares are used for transmission and computation of result, which is hence secure and reliable and does not make any number theoretic assumptions for security.
Abstract: E-voting systems (EVS)are having potential advantages over many existing voting schemes.Security, transparency, accuracy and reliability are the major concern in these systems.EVS continues to grow as the technology advances.It is inexpensive and efficient as the resources become reusable.Fast and accurate computation of results with voter privacy is the added advantage.In the proposed system we make use of secret sharing technique and secure multi party computation(SMC) to achieve security and reliability.Secret sharing is an important technique used for SMC. Multi-party computation is typically accomplished using secret sharing by making shares of the input and manipulating the shares to compute a typical function of the input.The proposed system make use of bitwise representation of votes and only the shares are used for transmission and computation of result.Secure sum evaluation can be done with shares distributed using Shamir's secret sharing scheme.The scheme is hence secure and reliable and does not make any number theoretic assumptions for security.We also propose a unique method which calculates the candidates individual votes keeping the anonymity.

36 citations


Network Information
Related Topics (5)
Cryptography
37.3K papers, 854.5K citations
89% related
Encryption
98.3K papers, 1.4M citations
88% related
Authentication
74.7K papers, 867.1K citations
87% related
Server
79.5K papers, 1.4M citations
82% related
Time complexity
36K papers, 879.5K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023284
2022643
2021225
2020288
2019233
2018228