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.

Catch you if you lie to me: Efficient verifiable conjunctive keyword search over large dynamic encrypted cloud data

Abstract: Encrypted data search allows cloud to offer fundamental information retrieval service to its users in a privacy-preserving way. In most existing schemes, search result is returned by a semi-trusted server and usually considered authentic. However, in practice, the server may malfunction or even be malicious itself. Therefore, users need a result verification mechanism to detect the potential misbehavior in this computation outsourcing model and rebuild their confidence in the whole search process. On the other hand, cloud typically hosts large outsourced data of users in its storage. The verification cost should be efficient enough for practical use, i.e., it only depends on the corresponding search operation, regardless of the file collection size. In this paper, we are among the first to investigate the efficient search result verification problem and propose an encrypted data search scheme that enables users to conduct secure conjunctive keyword search, update the outsourced file collection and verify the authenticity of the search result efficiently. The proposed verification mechanism is efficient and flexible, which can be either delegated to a public trusted authority (TA) or be executed privately by data users. We formally prove the universally composable (UC) security of our scheme. Experimental result shows its practical efficiency even with a large dataset.

BD-VTE: A Novel Baseline Data Based Verifiable Trust Evaluation Scheme for Smart Network Systems

Abstract: Billions of sensors and devices are connecting to the Internet of Thing (IoT) and generating massive data which are benefit for smart network systems. However, low-cost, secure, and efficient data collection from billions of IoT devices in smart city is a huge challenge. Recruiting mobile vehicles (MVs) has been proved to be an effective data collection scheme. However, the previous approaches rarely considered the security. In this paper, a novel Baseline Data based Verifiable Trust Evaluation (BD-VTE) scheme is proposed to guarantee security at a low cost. BD-VTE scheme includes Verifiable Trust Evaluation (VTE) mechanism, Effectiveness-based Incentive (EI) mechanism, and Secondary Path Planning (SPP) strategy, which are respectively used for reliable trust evaluation, reasonable reward, and efficient path adjustment. Among them, an active trust verification mechanism is innovatively proposed in the VTE mechanism, which evaluates the trust of MVs by sending UAVs to perceive IoT devices data as baseline data. This is a fundamental change to the previous passive and unverifiable trust mechanism. The simulation results show that BD-VTE scheme reduces the cost by at least 25.12% ∼ 38.03%, improves the collection rate by 0.91% ∼ 9.65% and increases the accuracy by 10.28% on average compared with the previous strategies.

Secret sharing schemes with bipartite access structure

Abstract: We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given. These results are applied to the particular case of weighted threshold access structure with two weights.

Verification of a Cryptographic Primitive: SHA-256

Abstract: This article presents a full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of functional correctness in the Coq proof assistant, using the Verifiable C program logic. Verifiable C is a separation logic for the C language, proved sound with respect to the operational semantics for C, connected to the CompCert verified optimizing C compiler.