Fireflies: A Secure and Scalable Membership and Gossip Service

被引:16
|
作者
Johansen, Havard D. [1 ]
van Renesse, Robbert [2 ]
Vigfusson, Ymir [3 ,4 ]
Johansen, Dag [1 ]
机构
[1] UIT Arctic Univ Norway, Dept Comp Sci, N-9019 Tromso, Norway
[2] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[3] Emory Univ, Dept Math & CS, Atlanta, GA 30322 USA
[4] Reykjavik Univ, Reykjavik, Iceland
来源
ACM TRANSACTIONS ON COMPUTER SYSTEMS | 2015年 / 33卷 / 02期
基金
美国国家科学基金会;
关键词
Design; Performance; Security; Byzantine failures; gossip; membership management; overlay network; DISSEMINATION;
D O I
10.1145/2701418
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An attacker who controls a computer in an overlay network can effectively control the entire overlay network if the mechanism managing membership information can successfully be targeted. This article describes Fireflies, an overlay network protocol that fights such attacks by organizing members in a verifiable pseudorandom structure so that an intruder cannot incorrectly modify the membership views of correct members. Fireflies provides each member with a view of the entire membership, and supports networks with moderate total churn. We evaluate Fireflies using both simulations and PlanetLab to show that Fireflies is a practical approach for secure membership maintenance in such networks.
引用
收藏
页数:32
相关论文
共 50 条
  • [31] Evaluation of gossip to build scalable and reliable multicast protocols
    Tanaraksiritavorn, S
    Mishra, S
    [J]. MASCOTS 2002: 10TH IEEE INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATIONS SYSTEMS, PROCEEDINGS, 2002, : 463 - 470
  • [32] Brief announcement: Convergence analysis of scalable gossip protocols
    Patterson, Stacy
    Bamieh, Bassam
    El Abbadi, Amr
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 540 - 542
  • [33] A scalable Bloom filter for membership queries
    Xie, Kun
    Min, Yinghua
    Zhang, Dafang
    Wen, Jigang
    Xie, Gaogang
    [J]. GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 543 - +
  • [34] Ad hoc membership for scalable applications
    Anker, T
    Dolev, D
    Shnayderman, I
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2002, 2508 : 191 - 205
  • [35] Designing a Secure and Scalable Service Agent for IoT Transmission through Blockchain and MQTT Fusion
    Hsu, Tse-Chuan
    [J]. APPLIED SCIENCES-BASEL, 2024, 14 (07):
  • [36] SECURE MULTI-PARTY CONSENSUS GOSSIP ALGORITHMS
    Lazzeretti, Riccardo
    Horn, Steven
    Braca, Paolo
    Willett, Peter
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [37] SIM: Secure Interval Membership Testing and Applications to Secure Comparison
    Yu, Albert
    Lu, Donghang
    Kate, Aniket
    Maji, Hemanta K.
    [J]. 2023 IEEE 8TH EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY, EUROS&P, 2023, : 757 - 772
  • [38] Smart Gossip: An adaptive gossip-based broadcasting service for sensor networks
    Kyasanur, Pradeep
    Choudhury, Romit Roy
    Gupta, Indranil
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON MOBILE ADHOC AND SENSOR SYSTEMS, VOLS 1 AND 2, 2006, : 884 - +
  • [39] A configurable membership service
    Hiltunen, MA
    Schlichting, RD
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (05) : 573 - 586
  • [40] On the effects of partial membership knowledge on reliability of gossip-based multicast
    Tsuchiya, T
    Kikuno, T
    [J]. 10TH IEEE PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING, PROCEEDINGS, 2004, : 76 - 83