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
TL;DR: A secure and verifiable one-to-many data sharing scheme that uses blockchain to record the access policy, realizing user self-certification and cloud non-repudiation, and supports data revocation when a vehicular user no longer wants to share the data in VSNs.
Abstract: The vehicular social networks (VSNs) supports diverse kinds of services such as traffic management, road safety, and sharing data (videos, audios, roads photos, air quality, and so on). However, its complex, large-scale and dynamic network structure poses new security challenges. Among these challenges, secure data transmission has turned to be a spotlight. Ciphertext-policy attribute-based encryption (CP-ABE) may be adopted to realize one-to-many data sharing in VSNs. In traditional CP-ABE schemes, access policy is stored and granted by the could, which lacks credibility due to centralization. In this article, we propose a secure and verifiable one-to-many data sharing scheme to solve the above problem. We use blockchain to record the access policy, realizing user self-certification and cloud non-repudiation. Considering the computing capabilities of the vehicular user, we propose an effective scheme for certificating. Meanwhile, considering the sensitive information included in the access policy, we propose a policy hiding scheme. Our scheme also supports data revocation when a vehicular user no longer wants to share the data in VSNs. Finally, security analysis and simulation show our scheme is both secure and efficient.

86 citations

Journal ArticleDOI
TL;DR: In this multiparty quantum secret sharing scheme, all agents are not required to prepare entangled states or perform any local unitary operation, and the total efficiency of the scheme approaches to 100%.

86 citations

Journal ArticleDOI
TL;DR: An expression is derived that shows how many quantum shares can be saved in this protocol, and several features that are available for classical secret-sharing schemes become available with this protocol.
Abstract: We propose a protocol that enables a dealer to share a quantum secret with n players using less than n quantum shares for several access structures. For threshold schemes we derived an expression that shows how many quantum shares can be saved in this scheme. Also, several features that are available for classical secret-sharing schemes (and previously not known to be possible for quantum secret-sharing) become available with this protocol.

86 citations

Journal ArticleDOI
TL;DR: This article proposes the VFL, a verifiable federated learning with privacy-preserving for big data in industrial IoT that uses Lagrange interpolation to elaborately set interpolation points for verifying the correctness of the aggregated gradients.
Abstract: Due to the strong analytical ability of big data, deep learning has been widely applied to model on the collected data in industrial IoT. However, for privacy issues, traditional data-gathering centralized learning is not applicable to industrial scenarios sensitive to training sets, such as face recognition and medical systems. Recently, federated learning has received widespread attention, since it trains a model by only sharing gradients without accessing training sets. But existing researches reveal that the shared gradient still retains the sensitive information of the training set. Even worse, a malicious aggregation server may return forged aggregated gradients. In this paper, we propose the VFL, a verifiable federated learning with privacy-preserving for big data in industrial IoT. Specifically, we use Lagrange interpolation to elaborately set interpolation points for verifying the correctness of the aggregated gradients. Compared with existing schemes, the verification overhead of VFL remains constant regardless of the number of participants. Moreover, we employ the blinding technology to protect the privacy of the privacy gradients. If no more than n-2 of n participants collude with the aggregation server, VFL could guarantee the encrypted gradients of other participants not being inverted. Experimental evaluations corroborate the practical performance of the presented VFL with high accuracy and efficiency.

85 citations

Proceedings ArticleDOI
26 Oct 2005
TL;DR: This work presents a storage and communication-efficient scheme for asynchronous verifiable information dispersal that achieves an asymptotically optimal storage blow-up and shows how to guarantee the secrecy of the stored data with respect to an adversary that may mount adaptive attacks.
Abstract: Information dispersal addresses the question of storing a file by distributing it among a set of servers in a storage-efficient way. We introduce the problem of verifiable information dispersal in an asynchronous network, where up to one third of the servers as well as an arbitrary number of clients might exhibit Byzantine faults. Verifiability ensures that the stored information is consistent despite such faults. We present a storage and communication-efficient scheme for asynchronous verifiable information dispersal that achieves an asymptotically optimal storage blow-up. Additionally, we show how to guarantee the secrecy of the stored data with respect to an adversary that may mount adaptive attacks. Our technique also yields a new protocol for asynchronous reliable broadcast that improves the communication complexity by an order of magnitude on large inputs.

85 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