Dynamic, Privacy-Preserving Decentralized Reputation Systems

被引:23
作者
Clark, Michael R. [1 ,2 ]
Stewart, Kyle [1 ]
Hopkinson, Kenneth M. [1 ]
机构
[1] Air Force Inst Technol, Wright Patterson AFB, OH 45433 USA
[2] Tenet 3 LLC, Wright Patterson AFB, OH 45433 USA
关键词
Reputation systems; cryptography; multiparty computation; mobile ad-hoc networks;
D O I
10.1109/TMC.2016.2635645
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Reputation systems provide an important basis for judging whether to interact with others in a networked system. Designing such systems is especially interesting in decentralized environments such as mobile ad-hoc networks, as there is no trusted authority to manage reputation feedback information. Such systems also come with significant privacy concerns, further complicating the issue. Researchers have proposed privacy-preserving decentralized reputation systems (PDRS) which ensure individual reputation information is not leaked. Instead, aggregate information is exposed. Unfortunately, in existing PDRS, when a party leaves the network, all of the reputation information they possess about other parties in the network leaves too. This is a significant problem when applying such systems to the kind of dynamic networks we see in mobile computing. In this article, we introduce dynamic, privacy-preserving reputation systems (Dyn-PDRS) to solve the problem. We enumerate the features that a reputation system must support in order to be considered a Dyn-PDRS. Furthermore, we present protocols to enable these features and describe how our protocols are composed to form a Dyn-PDRS. We present simulations of our ideas to understand how a Dyn-PDRS impacts information availability in the network, and report on an implementation of our protocols, including timing experiments.
引用
收藏
页码:2506 / 2517
页数:12
相关论文
共 30 条
  • [21] Preserving privacy of feedback providers in decentralized reputation systems
    Hasan, Omar
    Brunie, Lionel
    Bertino, Elisa
    [J]. COMPUTERS & SECURITY, 2012, 31 (07) : 816 - 826
  • [22] Kamvar S. D., 2003, WWW 03, P640, DOI [10.1145/775152.775242, DOI 10.1145/775152.775242]
  • [23] Kreuter B., 2012, USENIX SECURITY S, P285
  • [24] Efficient Lookup-Table Protocol in Secure Multiparty Computation
    Launchbury, John
    Diatchki, Iavor S.
    DuBuisson, Thomas
    Adams-Moran, Andy
    [J]. ACM SIGPLAN NOTICES, 2012, 47 (09) : 189 - 200
  • [25] Li M, 2011, IEEE INFOCOM SER, P2435, DOI 10.1109/INFCOM.2011.5935065
  • [26] Narayanan Arvind., 2011, Proceedings of the Network and Distributed System Security Symposium, NDSS 2011, P1
  • [27] Pavlov E, 2004, LECT NOTES COMPUT SC, V2995, P108
  • [28] HOW TO SHARE A SECRET
    SHAMIR, A
    [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (11) : 612 - 613
  • [29] Wong T.M., 2002, CMUCS02114
  • [30] Yao A. C., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P162, DOI 10.1109/SFCS.1986.25