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.

SVkNN: Efficient Secure and Verifiable k-Nearest Neighbor Query on the Cloud Platform *

Abstract: With the boom in cloud computing, data outsourcing in location-based services is proliferating and has attracted increasing interest from research communities and commercial applications. Nevertheless, since the cloud server is probably both untrusted and malicious, concerns of data security and result integrity have become on the rise sharply. However, there exist little work that can commendably assure the data security and result integrity using a unified way. In this paper, we study the problem of secure and verifiable k nearest neighbor query (SVkNN). To support SVkNN, we first propose a novel unified structure, called verifiable and secure index (VSI). Based on this, we devise a series of secure protocols to facilitate query processing and develop a compact verification strategy. Given an SVkNN query, our proposed solution can not merely answer the query efficiently while can guarantee: 1) preserving the privacy of data, query, result and access patterns; 2) authenticating the correctness and completeness of the results without leaking the confidentiality. Finally, the formal security analysis and complexity analysis are theoretically proven and the performance and feasibility of our proposed approaches are empirically evaluated and demonstrated.

Civitas: A Secure Remote Voting System

Abstract: Civitas is the first implementation of a coercion-resistant, universally verifiable, remote voting scheme. This paper describes the design of Civitas, details the cryptographic protocols used in its construction, and illustrates how language-enforced information-flow security policies yield assurance in the implementation. The performance of Civitas scales well in the number of voters and offers reasonable tradeoffs between time, cost, and security. These results suggest that secure electronic voting is achievable. The name of this system as presented at Dagstuhl was CIVS. In August 2007, the name was changed to Civitas. For more information, see the Civitas website at http://www.cs.cornell.edu/projects/civitas.

Secret image sharing based on chaotic map and chinese remainder theorem

Abstract: Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be reconstructed if and only if r or more legal participants cooperate together. These schemes have no pixel expansion. It is general in nature and can be applied on any image size. The proposed scheme is based on the chaotic map and the Chinese Remainder theorem. The security of the scheme is analyzed and the protocol is proven to be secure and be able to resist statistic and exhaustive attacks.

Public Verifiable Signcryption Schemes with Forward Secrecy Based on Hyperelliptic Curve Cryptosystem

Abstract: Signcryption is a process of combining encryption and signature into a single logical step. Traditional signcryption schemes provide message confidentiality and sender authentication, sender authentication can only be provided after unsigncryption of signcrypted text, so the third part can only verify the sender after breaching the confidentiality. In public verifiable signcryption schemes a third party or judge can verify authenticity of sender without breaching the confidentiality and without knowing the receiver private key, the judge just needs the signcrypted text and some additional parameters. In this paper, we proposed a resource efficient Hyperelliptic curve cryptosystem based signcryption schemes to provide message confidentiality, authentication, integrity, unforgeability, non-repudiation, along with forward secrecy and public verifiability. In case of dispute the judge can verify signcrypted text directly without sender/receiver private parameters. Our schemes are resource efficient and can be applied to any resource constrained environments.