A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables-Reference-Cited by-同舟云学术

A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Augustine John¹,Chatterjee Soumyottam²,Pandurangan Gopal³

Affiliation:

1. Indian Institute of Technology Madras, Chennai, India

2. Ashoka University, Sonipat, India

3. University of Houston, Houston, TX, USA

Funder

DST/SERB MATRICS

National Science Foundation

DST/SERB VAJRA visiting faculty scheme

Centre of Excellence in Cryptography Cybersecurity and Distributed Trust under the IIT Madras Institute of Eminence Scheme

U.S.-Israel Binational Science Foundation (BSF)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538588

Reference52 articles.

1. [n.d.]. Freenet. https://freenetproject.org/. Accessed: 2018-07--16. [n.d.]. Freenet. https://freenetproject.org/. Accessed: 2018-07--16.

2. [n.d.]. Website of BitTorrent. https://www.bittorrent.com/. Accessed: 2018-07--15. [n.d.]. Website of BitTorrent. https://www.bittorrent.com/. Accessed: 2018-07--15.

3. Ittai Abraham , Dahlia Malkhi , and Oren Dobzinski . 2004 . LAND: Stretch (1 + ) Locality-Aware Networks for DHTs . In Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms ( New Orleans, Louisiana) (SODA '04). Society for Industrial and Applied Mathematics, USA, 550--559. Ittai Abraham, Dahlia Malkhi, and Oren Dobzinski. 2004. LAND: Stretch (1 + ) Locality-Aware Networks for DHTs. In Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms (New Orleans, Louisiana) (SODA '04). Society for Industrial and Applied Mathematics, USA, 550--559.

4. John Augustine , Valerie King , Anisur Rahaman Molla , Gopal Pandurangan, and Jared Saia. 2020 . Scalable and Secure Computation Among Strangers: Message- Competitive Byzantine Protocols. In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 31:1--31: 19 . https://doi.org/10.4230/LIPIcs.DISC.2020.31 10.4230/LIPIcs.DISC.2020.31 John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, and Jared Saia. 2020. Scalable and Secure Computation Among Strangers: Message- Competitive Byzantine Protocols. In 34th International Symposium on Distributed Computing (DISC 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 31:1--31:19. https://doi.org/10.4230/LIPIcs.DISC.2020.31

5. Storage and search in dynamic peer-to-peer networks

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Goldfish: Peer Selection using Matrix Completion in Unstructured P2P Network;2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC);2023-05-01

2. Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21

3. Robust Overlays Meet Blockchains;Lecture Notes in Computer Science;2023

4. Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications;Lecture Notes in Computer Science;2022