With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation (SMPC) gives a general solution to these applications and has become a hot topic. Yao's garbled circuit approach is a leading method in designing protocols for secure two-party computation (2PC), which is a very important base in SMPC. However, there are only few protocols obtaining the fairness of secure 2PC, and only one of them was constructed within the standard simulation framework but with very low efficiency. In this paper, we propose an efficient fair secure Yao's garbled circuit protocol within the universally composable (UC) framework. By comparing with all other fair secure Yao's protocols, our new protocol enjoys three advantages. First, our protocol is more efficient than any other fair secure Yao's protocols within the standard simulation framework. Second, our protocol is the first fair UC-secure Yao's garbled circuit protocol, so it is more secure than other fair Yao's protocols. Third, there does not require any third party involved in our protocol; thus, it is very suitable for many applications.
We propose a blind quantum search protocol based on quantum homomorphic encryption, in which a client Alice with limited quantum ability can give her encrypted data to a powerful but untrusted quantum server and let the server search for her without decryption. By outsourcing the interactive key update process to a trusted key center, Alice only needs to encrypt her original data and decrypt the ciphered search result in linear time, and perfectly conceals the underlying plaintext from the search server as well. Besides, we also present a compact and secure quantum homomorphic evaluation protocol for Clifford circuits, where all possible keys are updated in parallel by the evaluator, and another server who would not contact the evaluator then searches out the true decryption key. In contrast with the CL scheme proposed by Broadbent, such protocol does not need any help from classical homomorphic encryption to achieve compactness.Please note: Abbreviations should be introduced at the first mention in the main text -no abbreviations lists. Suggested structure of main text (not enforced) is provided below. arXiv:1711.10066v2 [quant-ph] 25 Nov 2018 1. Randomly generate a four-bit encryption key ek = (x 0 , z 0 ) for |ψ . 6/15 15/15
Communication messages in vehicular ad hoc networks (VANETs) can be used to locate and track vehicles, and this can lead to threats on location privacy of vehicle users. In this paper, we address the problem of privacy and liability in VANETs. We propose a scheme that provides location privacy by utilizing a variant of ring signature. It allows a vehicle to form a ring arbitrarily with nearby vehicles and sign its messages anonymously, so that it can hide itself in the surrounding vehicles. When solving a dispute, the real signer will be responsible for what it has signed as the anonymity is revocable by the authority.
P2P Networks are self-organized and distributed. Efficient nodes risk assessment is one of the key factors for high quality resource exchanging. Most assessment methods based on trust or reputation have some remarkable drawbacks. For example, some methods impose too many restrictions to the samples, and many methods can't identify the malicious recommendations, which result in that the final results are not convincible and credible. To solve these problems, we propose a novel risk assessment method based on grey theory. In our scheme, the communication nodes' incomplete information state is described as several key attributes. Original data of these attributes is collected using taste concourse method to avoid malicious recommendation. The analysis and computing example shows this scheme is an efficient incomplete information nodes risk assessment method in P2P networks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.