The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
FruitChains: A Fair Blockchain
Abstract
Nakamoto's famous blockchain protocol enables achieving consensus in a so-called permissionless setting---anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identities of the players. His ingenious protocol prevents "sybil attacks" (where an adversary spawns any number of new players) by relying on computational puzzles (a.k.a. "moderately hard functions") introduced by Dwork and Naor (Crypto'92). Recent work by Garay et al (EuroCrypt'15) and Pass et al (manuscript, 2016) demonstrate that this protocol provably achieves consistency and liveness assuming a) honest players control a majority of the computational power in the network, b) the puzzle-hardness is appropriately set as a function of the maximum network delay and the total computational power of the network, and c) the computational puzzle is modeled as a random oracle. Assuming honest participation, however, is a strong assumption, especially in a setting where honest players are expected to perform a lot of work (to solve the computational puzzles). In Nakamoto's Bitcoin application of the blockchain protocol, players are incentivized to solve these puzzles by receiving rewards for every "block" (of transactions) they contribute to the blockchain. An elegant work by Eyal and Sirer (FinancialCrypt'14), strengthening and formalizing an earlier attack discussed on the Bitcoin forum, demonstrates that a coalition controlling even a minority fraction of the computational power in the network can gain (close to) 2 times its "fair share" of the rewards (and transaction fees) by deviating from the protocol instructions. In contrast, in a fair protocol, one would expect that players controlling a φ fraction of the computational resources to reap a φ fraction of the rewards.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bitcoin: A Peer-to-Peer Electronic Cash System
Wright, C. S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 13,922
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_12 · Cited by 1,459
Majority Is Not Enough: Bitcoin Mining Is Vulnerable
Eyal, I., & Sirer, E. G. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_28 · Cited by 1,375
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
Pricing via processing or combatting junk mail
Dwork, C., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_10 · Cited by 1,282
Secure High-Rate Transaction Processing in Bitcoin
Sompolinsky, Y., & Zohar, A. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-47854-7_32 · Cited by 693
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
Self-citationStubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack
Nayak, K., Kumar, S., Miller, A., & Shi, E. (2016) · 2016 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2016.32 · Cited by 481
Self-citationOptimal Selfish Mining Strategies in Bitcoin
Sapirshtein, A., Sompolinsky, Y., & Zohar, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54970-4_30 · Cited by 477
On the Instability of Bitcoin Without the Block Reward
Carlsten, M., Kalodner, H., Weinberg, S. M., & Narayanan, A. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978408 · Cited by 328
Cited by
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_12 · Cited by 1,459
Security and Privacy on Blockchain
Zhang, R., Xue, R., & Liu, L. (2020) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 959
Future challenges on the use of blockchain for food traceability analysis
Galvez, J. F., Mejuto, J. C., & Simal-Gandara, J. (2018) · TrAC Trends in Analytical Chemistry · doi:10.1016/j.trac.2018.08.011 · Cited by 921
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
Self-citationWhen Mobile Blockchain Meets Edge Computing
Xiong, Z., Zhang, Y., Niyato, D., Wang, P., & Han, Z. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1701095 · Cited by 551
Casper the Friendly Finality Gadget
Schwarz-Schilling, C., Saleh, F., Thiery, T., Pan, J., Shah, N., & Monnot, B. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.aft.2023.30 · Cited by 405
Bhat, S. A., Huang, N.-F., Sofi, I. B., & Sultan, M. (2021) · Agriculture · doi:10.3390/agriculture12010040 · Cited by 338
Demystifying blockchain: A critical analysis of challenges, applications and opportunities
Upadhyay, N. (2020) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2020.102120 · Cited by 286
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
The rise of “blockchain”: bibliometric analysis of blockchain study
Firdaus, A., Razak, M. F. A., Feizollah, A., Hashem, I. A. T., Hazim, M., & Anuar, N. B. (2019) · Scientometrics · doi:10.1007/s11192-019-03170-4 · Cited by 208
Privacy-preserved task offloading in mobile blockchain with deep reinforcement learning
Nguyen, D. C., Pathirana, P. N., Ding, M., & Seneviratne, A. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.3010967 · Cited by 178
“The size of block data to be mined is [5-10] kB.”
Background
Metadata
- Authors
- Pass, R., & Shi, E.
- Venue
- Proceedings of the ACM Symposium on Principles of Distributed Computing
- Publisher
- ACM
- Published
- 2017-07-25
- Pages
- 315-324
- OpenAlex
- W2738891482
- Cited by
- 307
- References
- 17
- FWCI
- 29.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.