DogFish: Decentralized Optimistic Game-theoretic FIle SHaring

No abstract is available for this paper.

• Publication year

  2018

• Venue

  International Conference on Applied Cryptography and Network Security

• Publication date

  2018-07-02

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-93387-0_36
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• JustTorrent: Value Based - Fairer and Faster Protocols for P2P File Sharing

  2017cited by this paper
• Valuation of information and the associated overpayment problem in peer-to-peer systems

  2016cited by this paper
• A Social Network Based Reputation System for Cooperative P2P File Sharing

  2015cited by this paper
• Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

  2015cited by this paper
• On the Range of Equilibria Utilities of a Repeated Epidemic Dissemination Game with a Mediator

  2014cited by this paper
• Dynamic Proofs of Retrievability Via Oblivious RAM

  2013cited by this paper
• Understanding and Improving Piece-Related Algorithms in the BitTorrent Protocol

  2013cited by this paper
• Designing incentives in P2P systems.

  2013influential reference
• Analysis of distribution time of multiple files in a P2P network

  2013cited by this paper
• Official Arbitration with Secure Cloud Storage Application

  2013cited by this paper
• An Equilibrium Analysis of Scrip Systems

  2012cited by this paper
• Remote data checking using provable data possession

  2011cited by this paper
• Collusion in peer-to-peer systems

  2011cited by this paper
• RatFish: A File Sharing Protocol Provably Secure against Rational Users

  2010influential reference
• Optimistic Fair Exchange with Multiple Arbiters

  2010cited by this paper
• Usable optimistic fair exchange

  2010cited by this paper
• Robust and Efficient Incentives for Cooperative Content Distribution

  2009cited by this paper
• Proofs of Storage from Homomorphic Identification Protocols

  2009cited by this paper
• Proofs of Retrievability via Hardness Amplification

  2009cited by this paper
• prTorrent: On establishment of piece rarity in the BitTorrent unchoking algorithm

  2009influential reference
• A Note on Distributed Stable Matching

  2009cited by this paper
• Dynamic provable data possession

  2009cited by this paper
• Bittorrent is an auction: analyzing and improving bittorrent's incentives

  2008influential reference
• Compact Proofs of Retrievability

  2008cited by this paper
• Beyond nash equilibrium: solution concepts for the 21st century

  2008cited by this paper
• Making p2p accountable without losing privacy

  2007cited by this paper
• Pors: proofs of retrievability for large files

  2007cited by this paper
• Do Incentives Build Robustness in BitTorrent? (Awarded Best Student Paper)

  2007cited by this paper
• Effective Choice in the Prisoner ' s Dilemma

  2007cited by this paper
• The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design

  2006cited by this paper
• EquiCast: scalable multicast with selfish users

  2006cited by this paper
• Free Riding in BitTorrent is Cheap

  2006cited by this paper
• Greedy Cheating Liars and the Fools Who Believe Them

  2006cited by this paper
• Peer-Assisted File Distribution: The Minimum Distribution Time

  2006cited by this paper
• Distributed Stable Matching Problems with Ties and Incomplete Lists

  2006cited by this paper
• Fair File Swarming with FOX

  2006cited by this paper
• BAR fault tolerance for cooperative services

  2005cited by this paper
• Distributed Stable Matching Problems

  2005cited by this paper
• How To Exchange Secrets with Oblivious Transfer

  2005cited by this paper
• Robust incentive techniques for peer-to-peer networks

  2004cited by this paper
• Incentives Build Robustness in Bit-Torrent

  2003cited by this paper
• KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing

  2003cited by this paper
• Constant-round coin-tossing with a man in the middle or realizing the shared random string model

  2002cited by this paper
• Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

  2001cited by this paper
• On the Impossibility of Fair Exchange without a Trusted Third Party

  1999influential reference
• Optimistic fair exchange of digital signatures

  1998influential reference
• Implicit Coalitions in a Generalized Prisoner's Dilemma

  1988cited by this paper
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma

  1985cited by this paper
• Coin flipping by telephone a protocol for solving impossible problems

  1983cited by this paper
• More Effective Choice in the Prisoner's Dilemma

  1980cited by this paper
• ? 1994 the Review of Economic Studies Limited Dilemma with Anonymous Random Matching

  year unknowncited by this paper

• Gamu Blue: A Practical Tool for Game Theory Security Equilibria

  2024cites this paper
• Analysis of minimum distribution time of two-class tit-for-tat-based P2P file distribution

  2022cites this paper
• m-Stability: Threshold Security Meets Transferable Utility

  2021cites this paper