【摘 要】
:
Online social networks (OSNs) have revolutionarily changed the way people connect with each other. One of the main factors that help achieve this success is rep
【机 构】
:
Department of Electrical and Computer Engineering,CAS Key Laboratory of Electromagnetic Space Inform
【基金项目】
:
The work of Chi was supported in part by the National Natural Science Foundation of China (NSFC);This work was partially supported by the National Science Foundation of USA;the Innovation Foundation o
论文部分内容阅读
Online social networks (OSNs) have revolutionarily changed the way people connect with each other. One of the main factors that help achieve this success is reputation systems that enable OSN users to mutually establish trust relationships based on their past experience. Current approaches for the reputation management cannot achieve the fine granularity and verifiability for each individual user, in the sense that the reputation values on such OSNs are coarse and lack of credibility. In this paper, we propose a fine granularity attribute-based reputation system which enables users to rate each other’s attributes instead of identities. Our scheme first verifies each OSN user’s attributes, and further allows OSN users to vote on the posted attribute-associated messages to derive the reputation value. The attribute verification process provides the authenticity of the reputation value without revealing the actual value to entities who do not have the vote privilege. To predict a stranger’s behavior, we propose a reputation retrieval protocol for querying the reputation value on a specific attribute. To the best of our knowledge, we are the first to define a fine-grained reputation value based on users’ verified attributes in OSNs with privacy preservation. We provide the security analysis along with the simulation results to verify the privacy preservation and feasibility. The implementation of the proposed scheme on current OSNs is also discussed.
其他文献
Let x:M n?1→Rn be an umbilical free hypersurface with non-zero principal curvatures. M is called Laguerre isoparametric if it satisfies two conditions, namely,
We give expansions about the Gumbel distribution in inverse powers of n and log n for Mn, the maximum of a sample size n or n+1 when the j-th observation isμ(
As technology advances, there is a considerable gap between the congestion model used in global routing and the routing resource consumption in detailed routing
Not many methods for parameterization guarantee bijectivity or local injectivity, which is essential for foldover-free mappings. Stretch-minimizing parameteriza
Inverse lithography technology (ILT) is one of the promising resolution enhancement techniques (RETs), as the advanced integrated circuits (IC) technology nodes
From a visual point of view, the shape of an image is mainly determined by the edges. Conventional polynomial interpolation of image enlarging methods would pro
In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization (SDO) probl
In this article, we investigate the use of joint α-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the jointα-entropy. Fi
Cloud computing, after its success as a commercial infrastructure, is now emerging as a private infrastructure. The software platforms available to build privat
Previous collision detection methods for virtual disassembly mainly detect collisions at discrete time intervals, and use oriented bounding boxes to speed up th