Fetching the paper…
Reading the bibliography…
The past decade has witnessed the rapid evolution in blockchain technologies, which has attracted tremendous interests from both the research communities and industries.
M. Pease, R. Shostak, and L. Lamport, “Reaching agreement in the presence of faults,” Journal of the ACM , vol. 27, no. 2, pp. 228–234, 1980
1980
Earlier work this paper cites.
M. O. Rabin, “Transaction protection by beacons,” Journal of Computer and System Sciences , vol. 27, no. 2, pp. 256 – 267, 1983
1983
Earlier work this paper cites.
A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems,” in Proceedings on Advances in cryptology—CRYPTO ’86 , Santa Barbara, California, USA, Aug. 1986, pp. 186–194
1986
Earlier work this paper cites.
R. C. Merkle, “A digital signature based on a conventional encryption function,” in Advances in Cryptology - CRYPTO ’87: Conference on the Theory and Applications of Cryptographic Techniques , C. Pomerance, Ed., Santa Barbara, CA, Aug. 1987, pp. 369–378
1987
Earlier work this paper cites.
F. B. Schneider, “Implementing fault-tolerant services using the state machine approach: A tutorial,” ACM Computing Surveys , vol. 22, no. 4, pp. 299–319, Dec. 1990
1990
Earlier work this paper cites.
M. K. Reiter, “A secure group membership protocol,” IEEE Transactions on Software Engineering , vol. 22, no. 1, pp. 31–42, Jan. 1996
1996
Earlier work this paper cites.
M. Jakobsson and A. Juels, “Proofs of work and bread pudding protocols (extended abstract),” in Secure Information Networks: Communications and Multimedia Security IFIP TC6/TC11 Joint Working Conference on Communications and Multimedia Security (CMS’99) , Leuven, Belgium, Sep. 1999, pp. 258–272
1999
Earlier work this paper cites.
S. Micali, M. Rabin, and S. Vadhan, “Verifiable random functions,” in 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) , New York City, NY, Oct. 1999, pp. 120–130
1999
Earlier work this paper cites.
C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, “Secure and efficient asynchronous broadcast protocols,” in Advances in Cryptology – CRYPTO 2001: 21st Annual International Cryptology Conference . Santa Barbara, CA: Springer Berlin Heidelberg, Aug. 2001, pp. 524–541
2001
Earlier work this paper cites.
O. Goldreich, “Zero-knowledge twenty years after its invention,” IACR Cryptology ePrint Archive, Report 2002/186, 2002, https://eprint.iacr.org/2002/186
2002
Earlier work this paper cites.
M. Castro and B. Liskov, “Practical byzantine fault tolerance and proactive recovery,” ACM Transactions on Computer Systems , vol. 20, no. 4, pp. 398–461, Nov. 2002
2002
Earlier work this paper cites.
P. Maymounkov and D. Mazières, “Kademlia: A peer-to-peer information system based on the xor metric,” in Peer-to-Peer Systems: First International Workshop , Cambridge, MA, Mar. 2002, pp. 53–65
2002
Earlier work this paper cites.
J. R. Douceur, “The sybil attack,” in First International Workshop on Peer-to-Peer Systems , Cambridge, MA, Mar. 2002, pp. 251–260
2002
Earlier work this paper cites.
D. Wagner, “A generalized birthday problem,” in Advances in Cryptology — CRYPTO 2002 , Santa Barbara, California, Aug. 2002, pp. 288–304
2002
Earlier work this paper cites.
L. von Ahn, M. Blum, N. J. Hopper, and J. Langford, “Captcha: Using hard ai problems for security,” in Advances in Cryptology – EUROCRYPT 2003: International Conference on the Theory and Applications of Cryptographic Techniques , Warsaw, Poland, May 2003, pp. 294–311
2003
Earlier work this paper cites.
J. Aspnes, C. Jackson, and A. Krishnamurthy, “Exposing computationally challenged byzantine impostors,” Yale University, Tech. Rep. YALEU/DCS/TR-1332, 2005
2005
Earlier work this paper cites.
J. Andersen and E. Weisstein, “Cunningham chain. from mathworld–a wolfram web resource,” 2005. [Online]. Available: http://mathworld.wolfram.com/CunninghamChain.html
2005
Earlier work this paper cites.
M. Correia, N. F. Neves, and P. Veríssimo, “From consensus to atomic broadcast: Time-free byzantine-resistant protocols without signatures,” The Computer Journal , vol. 49, no. 1, pp. 82–96, Jan. 2006
2006
Earlier work this paper cites.
A. Mohr, “A survey of zero-knowledge proofs with applications to cryptography,” Southern Illinois University, Carbondale, Tech. Rep., 2007
2007
Earlier work this paper cites.
N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic game theory . Cambridge University Press Cambridge, 2007, vol. 1
2007
Earlier work this paper cites.
A. Juels and B. S. Kaliski, Jr., “Pors: Proofs of retrievability for large files,” in Proceedings of the 14th ACM Conference on Computer and Communications Security . New York, NY, USA: ACM, Oct. 2007, pp. 584–597
2007
Earlier work this paper cites.
S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” Self-published Paper , May 2008. [Online]. Available: https://bitcoin.org/bitcoin.pdf
2008
Earlier work this paper cites.
C. Cachin, “Yet another visit to paxos,” IBM Research, Zurich, Switzerland, Tech. Rep. RZ3754 , 2009
2009
Earlier work this paper cites.
M. Raynal, Communication and agreement abstractions for fault-tolerant asynchronous distributed systems , ser. Synthesis Lectures on Distributed Computing Theory. Williston, VT: Morgan & Claypool Publishers, May 2010
2010
Earlier work this paper cites.
F. R. Yu, M. Huang, and H. Tang, “Biologically inspired consensus-based spectrum sensing in mobile ad hoc networks with cognitive radios,” IEEE Network , vol. 24, no. 3, pp. 26–30, May 2010
2010
Earlier work this paper cites.
2011
Earlier work this paper cites.
S. Al-Kuwari, J. H. Davenport, and R. J. Bradford, “Cryptographic hash functions: Recent design trends and security notions,” IACR Cryptology ePrint Archive, Report 2011/565, 2011, https://eprint.iacr.org/2011/565
2011
Earlier work this paper cites.
A. Lewko and B. Waters, “Unbounded hibe and attribute-based encryption,” in Advances in Cryptology – EUROCRYPT 2011 , Tallinn, Estonia, May 2011, pp. 547–567
2011
Earlier work this paper cites.
JSON-RPC Working Group, “Json-rpc 2.0 specification,” 2012
2012
Earlier work this paper cites.
M. Babaioff, S. Dobzinski, S. Oren, and A. Zohar, “On bitcoin and red balloons,” in Proceedings of the 13th ACM Conference on Electronic Commerce , ser. EC ’12. New York, NY: ACM, Jun. 2012, pp. 56–73
2012
Earlier work this paper cites.
S. King and S. Nadal, “Ppcoin: Peer-to-peer crypto-currency with proof-of-stake,” Self-published Paper , Aug. 2012. [Online]. Available: https://peercoin.net/assets/paper/peercoin-paper.pdf
2012
Earlier work this paper cites.
Z. Han, D. Niyato, W. Saad, T. Başar, and A. Hjørungnes, Game theory in wireless and communication networks: theory, models, and applications . Cambridge University Press, 2012
2012
Earlier work this paper cites.
C. Decker and R. Wattenhofer, “Information propagation in the bitcoin network,” in Proceedings of IEEE International Conference on Peer-to-Peer Computing , Trento, Italy, Sep. 2013, pp. 1–10
2013
Earlier work this paper cites.
V. Buterin, “Bitcoin network shaken by blockchain fork,” Bitcoin Mangazine , vol. 12, Mar. 2013. [Online]. Available: https://bitcoinmagazine.com/articles/bitcoin-network-shaken-by-blockchain-fork-1363144448/
2013
Earlier work this paper cites.
J. A. Kroll, I. C. Davey, and E. W. Felten, “The economics of bitcoin mining, or bitcoin in the presence of adversaries,” in Proceedings of The Workshop on the Economics of Information Security (WEIS) , vol. 2013, Washington, D.C., Jun. 2013
2013
Earlier work this paper cites.
E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza, “Snarks for c: Verifying program executions succinctly and in zero knowledge,” in Advances in Cryptology – CRYPTO 2013: 33rd Annual Cryptology Conference , Santa Barbara, CA, Aug. 2013, pp. 90–108
2013
Earlier work this paper cites.
S. King, “Primecoin: Cryptocurrency with prime number proof-of-work,” Self-published Paper , Jul. 2013. [Online]. Available: http://primecoin.io/bin/primecoin-paper.pdf
2013
Earlier work this paper cites.
M. Maschler, E. Solan, and S. Zamir, Game Theory . Cambridge University Press, 2013
2013
Earlier work this paper cites.
S. Ghosh, Distributed systems: an algorithmic approach . CRC press, 2014
2014
Earlier work this paper cites.
D. Schwartz, N. Youngs, and A. Britto, “The ripple protocol consensus algorithm,” Ripple Labs Inc White Paper , vol. 5, 2014
2014
Earlier work this paper cites.
V. Buterin, “Ethereum: A next-generation smart contract and decentralized application platform,” Ethereum Foundation, Tech. Rep., 2014. [Online]. Available: https://github.com/ethereum/wiki/wiki/White-Paper
2014
Earlier work this paper cites.
A. Biryukov, D. Khovratovich, and I. Pustogarov, “Deanonymisation of clients in bitcoin p2p network,” in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’14, Scottsdale, AZ, USA, 2014, pp. 15–29
2014
Earlier work this paper cites.
A. M. Antonopoulos, Mastering Bitcoin: unlocking digital cryptocurrencies . O’Reilly Media, Inc., 2014
2014
Earlier work this paper cites.
A. Miller and J. J. LaViola Jr, “Anonymous byzantine consensus from moderately-hard puzzles: A model for bitcoin,” University of Central Florida, Computer Science, Tech. Rep., Apr. 2014. [Online]. Available: http://nakamotoinstitute.org/research/anonymous-byzantine-consensus
2014
Earlier work this paper cites.
F. Sun and P. Duan, “Solving byzantine problems in synchronized systems using bitcoin,” Self-published Paper , Sep. 2014. [Online]. Available: https://allquantor.at/blockchainbib/pdf/sun2014solving.pdf
2014
Earlier work this paper cites.
A. Gervais, G. O. Karame, V. Capkun, and S. Capkun, “Is bitcoin a decentralized currency?” IEEE Security Privacy , vol. 12, no. 3, pp. 54–60, May 2014
2014
Earlier work this paper cites.
I. Eyal and E. G. Sirer, “Majority is not enough: Bitcoin mining is vulnerable (revised selected papers),” in Financial Cryptography and Data Security: 18th International Conference , Christ Church, Barbados, Mar. 2014, pp. 436–454
2014
Earlier work this paper cites.
I. Bentov, C. Lee, A. Mizrahi, and M. Rosenfeld, “Proof of activity: Extending bitcoin’s proof of work via proof of stake (extended abstract),” ACM SIGMETRICS Performance Evaluation Review , vol. 42, no. 3, pp. 34–37, Dec. 2014
2014
Earlier work this paper cites.
M. Ghosh, M. Richardson, B. Ford, and R. Jansen, “A torpath to torcoin: proof-of-bandwidth altcoins for compensating relays,” U.S. Naval Research Laboratory, Washington, DC, Tech. Rep., 2014
2014
Earlier work this paper cites.
A. Miller, A. Juels, E. Shi, B. Parno, and J. Katz, “Permacoin: Repurposing bitcoin work for data preservation,” in 2014 IEEE Symposium on Security and Privacy , San Jose, CA, May 2014, pp. 475–490
2014
Earlier work this paper cites.
S. Wilkinson, “Storj a peer-to-peer cloud storage network,” Storj Labs Inc., Tech. Rep., Dec. 2014. [Online]. Available: https://storj.io/storj.pdf
2014
Earlier work this paper cites.
D. Vorick and L. Champine, “Sia: Simple decentralized storage,” Nebulous Inc., Tech. Rep., Nov. 2014. [Online]. Available: https://coss.io/documents/white-papers/siacoin.pdf
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
N. Houy, “The economics of bitcoin transaction fees,” GATE Groupe d’Analyse et de Théorie Économique Lyon-St Étienne, Tech. Rep., Feb. 2014
2014
Earlier work this paper cites.
“Slimcoin: A peer-to-peer crypto-currency with proof-of-burn,” www.slimcoin.org, Tech. Rep., May 2014. [Online]. Available: https://github.com/slimcoin-project/slimcoin-project.github.io/blob/master/whitepaperSLM.pdf
2014
Earlier work this paper cites.
L. Ren, “Proof of stake velocity: Building the social currency of the digital age,” Self-published Paper , Apr. 2014. [Online]. Available: https://coss.io/documents/white-papers/reddcoin.pdf
2014
Earlier work this paper cites.
A. Poelstra, “Distributed consensus from proof of stake is impossible,” Self-published Paper , May 2014. [Online]. Available: https://download.wpsoftware.net/bitcoin/old-pos.pdf
2014
Earlier work this paper cites.
N. Houy, “It will cost you nothing to kill a proof-of-stake crypto-currency,” GATE Groupe d’Analyse et de Théorie Économique Lyon-St Étienne, Tech. Rep., 2014
2014
Earlier work this paper cites.
J. Kwon, “Tendermint: Consensus without mining (draft),” Self-published Paper , fall 2014. [Online]. Available: https://tendermint.com/static/docs/tendermint.pdf
2014
Earlier work this paper cites.
D. Larimer, “Delegated proof-of-stake (dpos),” Bitshare whitepaper, Tech. Rep., 2014
2014
Earlier work this paper cites.
J. Bonneau, A. Miller, J. Clark, A. Narayanan, J. A. Kroll, and E. W. Felten, “Sok: Research perspectives and challenges for bitcoin and cryptocurrencies,” in 2015 IEEE Symposium on Security and Privacy , San Jose, CA, May 2015, pp. 104–121
2015
Earlier work this paper cites.
M. Vukolić, “The quest for scalable blockchain fabric: Proof-of-work vs. bft replication,” in Open Problems in Network Security: IFIP WG 11.4 International Workshop , Zurich, Switzerland, Oct. 2015, pp. 112–125
2015
Earlier work this paper cites.
J. Garay, A. Kiayias, and N. Leonardos, “The bitcoin backbone protocol: Analysis and applications,” in Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Part II , Sofia, Bulgaria, Apr. 2015, pp. 281–310
2015
Earlier work this paper cites.
Y. Sompolinsky and A. Zohar, “Secure high-rate transaction processing in bitcoin,” in 19th International Conference on Financial Cryptography and Data Security , San Juan, Puerto Rico, Jan. 2015, pp. 507–527
2015
Earlier work this paper cites.
A. Mackenzie, S. Noether, and Monero Core Team, “Improving obfuscation in the cryptonote protocol,” Monero Research Lab, Tech. Rep., Jan. 2015
2015
Earlier work this paper cites.
A. Miller, A. Kosba, J. Katz, and E. Shi, “Nonoutsourceable scratch-off puzzles to discourage bitcoin mining coalitions,” in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’15. Denver, CO: ACM, Oct. 2015, pp. 680–691
2015
Earlier work this paper cites.
A. Kiayias and G. Panagiotakos, “Speed-security tradeoffs in blockchain protocols,” IACR Cryptology ePrint Archive, Report 2015/1019, 2015, https://eprint.iacr.org/2015/1019
2015
Earlier work this paper cites.
P. R. Rizun, “A transaction fee market exists without a block size limit,” Self-published Paper , Aug. 2015
2015
Earlier work this paper cites.
S. Park, K. Pietrzak, J. Alwen, G. Fuchsbauer, and P. Gazi, “Spacecoin: A cryptocurrency based on proofs of space,” MIT, Tech. Rep., Jun. 2015
2015
Earlier work this paper cites.
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Pietrzak, “Proofs of space,” in Advances in Cryptology – CRYPTO 2015: 35th Annual Cryptology Conference , Santa Barbara, CA, Aug. 2015, pp. 585–605
2015
Earlier work this paper cites.
A. Laszka, B. Johnson, and J. Grossklags, “When bitcoin mining pools run dry,” in Financial Cryptography and Data Security: FC 2015 International Workshops on BITCOIN, WAHC and Wearable , San Juan, Puerto Rico, Jan. 2015, pp. 63–77
2015
Earlier work this paper cites.
A. Stone, “An examination of single transaction blocks and their effect on network throughput and block size,” Self-published Paper , Jun. 2015. [Online]. Available: http://ensocoin.org/resources/1txn.pdf
2015
Earlier work this paper cites.
M. Möser and R. Böhme, “Trends, tips, tolls: A longitudinal study of bitcoin transaction fees,” in Financial Cryptography and Data Security: FC 2015 International Workshops on BITCOIN, WAHC and Wearable , San Juan, Puerto Rico, Jan. 2015, pp. 19–33
2015
Earlier work this paper cites.
L. Luu, R. Saha, I. Parameshwaran, P. Saxena, and A. Hobor, “On power splitting games in distributed computation: The case of bitcoin pooled mining,” in 2015 IEEE 28th Computer Security Foundations Symposium , Verona, Italy, Jul. 2015, pp. 397–411
2015
Earlier work this paper cites.
I. Eyal, “The miner’s dilemma,” in 2015 IEEE Symposium on Security and Privacy , San Jose, CA, May 2015, pp. 89–103
2015
Earlier work this paper cites.
E. Lombrozo, J. Lau, and P. Wuille, “Segregated witness (consensus layer),” Tech. Rep., Dec. 2015. [Online]. Available: https://github.com/bitcoin/bips/blob/master/bip-0141.mediawiki
2015
Earlier work this paper cites.
Y. Lewenberg, Y. Sompolinsky, and A. Zohar, “Inclusive block chain protocols,” in Financial Cryptography and Data Security , San Juan, Puerto Rico, Jan. 2015, pp. 528–547
2015
Earlier work this paper cites.
H. A. Kalodner, M. Carlsten, P. Ellenbogen, J. Bonneau, and A. Narayanan, “An empirical study of namecoin and lessons for decentralized namespace design,” in 2015 Workshop on the Economics of Information Security (WEIS) . Delft, Netherlands: TUDelft, Jun. 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
F. Tschorsch and B. Scheuermann, “Bitcoin and beyond: A technical survey on decentralized digital currencies,” IEEE Communications Surveys Tutorials , vol. 18, no. 3, pp. 2084–2123, third quarter 2016
2016
Cited alongside, same era.
K. Christidis and M. Devetsikiotis, “Blockchains and smart contracts for the internet of things,” IEEE Access , vol. 4, pp. 2292–2303, May 2016
2016
Cited alongside, same era.
P. Daian, I. Eyal, A. Juels, and E. G. Sirer, “(short paper) piecework: Generalized outsourcing control for proofs of work,” in Financial Cryptography and Data Security: FC 2017 International Workshops on WAHC, BITCOIN, VOTING, WTSC, and TA , Sliema, Malta, Apr. 2017, pp. 182–190
2017
Later among the works it cites.
R. Recabarren and B. Carbunar, “Hardening stratum, the bitcoin pool mining protocol,” Proceedings on Privacy Enhancing Technologies , vol. 2017, no. 3, pp. 57–74, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
N. Dimitri, “Bitcoin mining as a contest,” Ledger Journal , vol. 2, pp. 31–37, Apr. 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Kosba, A. Miller, E. Shi, Z. Wen, and C. Papamanthou, “Hawk: The blockchain model of cryptography and privacy-preserving smart contracts,” in 2016 IEEE Symposium on Security and Privacy (SP) , San Jose, CA, May 2016, pp. 839–858
2016
Cited alongside, same era.
Z. Zheng, S. Xie, H.-N. Dai, and H. Wang, “Blockchain challenges and opportunities: A survey,” School of Data and Computer Science, Sun Yat-sen University, Tech. Rep., 2016
2016
Cited alongside, same era.
Y. Sompolinsky, Y. Lewenberg, and A. Zohar, “Spectre: A fast and scalable cryptocurrency protocol,” IACR Cryptology ePrint Archive, Report 2016/1159, 2016, https://eprint.iacr.org/2016/1159
2016
Cited alongside, same era.
I. Bentov, A. Gabizon, and A. Mizrahi, “Cryptocurrencies without proof of work,” in International Conference on Financial Cryptography and Data Security , Christ Church, Barbados, Feb. 2016, pp. 142–157
2016
Cited alongside, same era.
A. Kiayias and G. Panagiotakos, “On trees, chains and fast transactions in the blockchain,” IACR Cryptology ePrint Archive, Report 2016/545, 2016, https://eprint.iacr.org/2016/545
2016
Cited alongside, same era.
C. Cachin, “Architecture of the hyperledger blockchain fabric,” in Workshop on Distributed Cryptocurrencies and Consensus Ledgers (DCCL 2016) , Chicago, IL, Jul. 2016
2016
Cited alongside, same era.
F. Baldimtsi, A. Kiayias, T. Zacharias, and B. Zhang, “Indistinguishable proofs of work or knowledge,” in Advances in Cryptology – ASIACRYPT 2016 , Hanoi, Vietnam, 2016, pp. 902–933
2016
Cited alongside, same era.
S. Liu, P. Viotti, C. Cachin, V. Quéma, and M. Vukolic, “Xft: Practical fault tolerance beyond crashes.” in 12th USENIX Symposium on Operating Systems Design and Implementation , Savannah, GA, Nov. 2016, pp. 485–500
2016
Cited alongside, same era.
A. Sapirshtein, Y. Sompolinsky, and A. Zohar, “Optimal selfish mining strategies in bitcoin,” in Financial Cryptography and Data Security: 20th International Conference, Revised Selected Papers , Christ Church, Barbados, Feb. 2017, pp. 515–532
2017
Later among the works it cites.
J. Beccuti and C. Jaag, “The bitcoin mining game: On the optimality of honesty in proof-of-work consensus mechanism,” Swiss Economics, Working Papers 0060, Aug. 2017. [Online]. Available: https://ideas.repec.org/p/chc/wpaper/0060.html
2017
Later among the works it cites.
D. K. Tosh, S. Shetty, X. Liang, C. A. Kamhoua, K. A. Kwiat, and L. Njilla, “Security implications of blockchain cloud with analysis of block withholding attack,” in 2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID) , Madrid, Spain, May 2017, pp. 458–467
2017
Later among the works it cites.
S. Bag, S. Ruj, and K. Sakurai, “Bitcoin block withholding attack: Analysis and mitigation,” IEEE Transactions on Information Forensics and Security , vol. 12, no. 8, pp. 1967–1978, Aug. 2017
2017
Later among the works it cites.
“Slushpool,” Dec. 2017. [Online]. Available: https://slushpool.com/home/
2017
Later among the works it cites.
L. Chen, L. Xu, N. Shah, Z. Gao, Y. Lu, and W. Shi, “On security analysis of proof-of-elapsed-time (poet),” in 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems , Boston, MA, Nov. 2017, pp. 282–297
2017
Later among the works it cites.
2017
Later among the works it cites.
W. Li, S. Andreina, J.-M. Bohli, and G. Karame, “Securing proof-of-stake blockchain protocols,” in Data Privacy Management, Cryptocurrencies and Blockchain Technology: ESORICS 2017 International Workshops , Oslo, Norway, Sep. 2017, pp. 297–315
2017
Later among the works it cites.
R. Pass and E. Shi, “Hybrid Consensus: Efficient Consensus in the Permissionless Model,” in 31st International Symposium on Distributed Computing (DISC 2017) , vol. 91, Vienna, Austria, Oct. 2017, pp. 39:1–39:16
2017
Later among the works it cites.
Y. Gilad, R. Hemo, S. Micali, G. Vlachos, and N. Zeldovich, “Algorand: Scaling byzantine agreements for cryptocurrencies,” in Proceedings of the 26th Symposium on Operating Systems Principles (SOSP ’17) . Shanghai, China: ACM, Oct. 2017, pp. 51–68
2017
Later among the works it cites.
M. Green and I. Miers, “Bolt: Anonymous payment channels for decentralized currencies,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’17. Dallas, Texas, USA: ACM, Oct. 2017, pp. 473–489
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Kiayias, A. Miller, and D. Zindros, “Non-interactive proofs of proof-of-work,” IACR Cryptology ePrint Archive, Report 2017/963, 2017, https://eprint.iacr.org/2017/963
2017
Later among the works it cites.
A. E. Gencer, R. van Renesse, and E. G. Sirer, “Short paper: Service-oriented sharding for blockchains,” in Financial Cryptography and Data Security , Sliema, Malta, Apr. 2017, pp. 393–401
2017
Later among the works it cites.
E. Syta, P. Jovanovic, E. K. Kogias, N. Gailly, L. Gasser, I. Khoffi, M. J. Fischer, and B. Ford, “Scalable bias-resistant distributed randomness,” in 2017 IEEE Symposium on Security and Privacy (SP) , San Jose, CA, May 2017, pp. 444–460
2017
Later among the works it cites.
A. Churyumov, “Byteball: a decentralized system for storage and transfer of value,” byteball.org, Tech. Rep., 2017
2017
Later among the works it cites.
S. Popov, O. Saa, and P. Finardi, “Equilibria in the tangle,” arXiv preprint arXiv:1712.05385 , 2017
2017
Later among the works it cites.
G. Hileman and M. Rauchs, “2017 global blockchain benchmarking study,” Cambridge Centre for Alternative Finance, Tech. Rep., 2017
2017
Later among the works it cites.
M. Bartoletti and L. Pompianu, “An analysis of bitcoin op_return metadata,” in Financial Cryptography and Data Security , Malta, Apr. 2017, pp. 218–230
2017
Later among the works it cites.
H. Shafagh, L. Burkhalter, A. Hithnawi, and S. Duquennoy, “Towards blockchain-based auditable storage and sharing of iot data,” in Proceedings of the 2017 on Cloud Computing Security Workshop , ser. CCSW ’17. Dallas, Texas, USA: ACM, Nov. 2017, pp. 45–50
2017
Later among the works it cites.
S. Raju, S. Boddepalli, S. Gampa, Q. Yan, and J. S. Deogun, “Identity management using blockchain for cognitive cellular networks,” in 2017 IEEE International Conference on Communications (ICC) , Paris, France, May 2017, pp. 1–6
2017
Later among the works it cites.
C. Xu, K. Wang, and M. Guo, “Intelligent resource management in blockchain-based cloud datacenters,” IEEE Cloud Computing , vol. 4, no. 6, pp. 50–59, November 2017
2017
Later among the works it cites.
X. Liang, S. Shetty, D. Tosh, C. Kamhoua, K. Kwiat, and L. Njilla, “Provchain: A blockchain-based data provenance architecture in cloud environment with enhanced privacy and availability,” in 2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID) , Madrid, Spain, May 2017, pp. 468–477
2017
Later among the works it cites.
S. Raju, S. Boddepalli, N. Choudhury, Q. Yan, and J. S. Deogun, “Design and analysis of elastic handoff in cognitive cellular networks,” in 2017 IEEE International Conference on Communications (ICC) , Paris, France, May 2017
2017
Later among the works it cites.
A. Lei, H. Cruickshank, Y. Cao, P. Asuquo, C. P. A. Ogah, and Z. Sun, “Blockchain-based dynamic key management for heterogeneous intelligent transportation systems,” IEEE Internet of Things Journal , vol. 4, no. 6, pp. 1832–1843, 2017
2017
Later among the works it cites.
N. Herbaut and N. Negru, “A model for collaborative blockchain-based video delivery relying on advanced network services chains,” IEEE Communications Magazine , vol. 55, no. 9, pp. 70–76, 2017
2017
Later among the works it cites.
M. Li, J. Weng, A. Yang, and W. Lu, “Crowdbc: A blockchain-based decentralized framework for crowdsourcing,” Online, available at: https://eprint.iacr.org/2017/444.pdf
2017
Later among the works it cites.
J. Kang, R. Yu, X. Huang, S. Maharjan, Y. Zhang, and E. Hossain, “Enabling localized peer-to-peer electricity trading among plug-in hybrid electric vehicles using consortium blockchains,” IEEE Transactions on Industrial Informatics , vol. PP, no. 99, pp. 1–1, 2017
2017
Later among the works it cites.
Y. Zhang, M. Pan, L. Song, Z. Dawy, and Z. Han, “A survey of contract theory-based incentive mechanism design in wireless networks,” IEEE Wireless Communications , vol. 24, no. 3, pp. 80–85, Jun. 2017
2017
Later among the works it cites.
J. Sidhu, “Syscoin: A peer-to-peer electronic cash system with blockchain-based services for e-business,” in 2017 26th International Conference on Computer Communication and Networks (ICCCN) , Vancouver, BC, Jul. 2017, pp. 1–6
2017
Later among the works it cites.
J. Bruce, “The mini-blockchain scheme rev 3,” Self-published Paper , Mar. 2017. [Online]. Available: http://cryptonite.info/files/mbc-scheme-rev3.pdf
2017
Later among the works it cites.
T. T. A. Dinh, R. Liu, M. Zhang, G. Chen, B. C. Ooi, and J. Wang, “Untangling blockchain: A data processing view of blockchain systems,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 7, pp. 1366–1385, 2018
2018
Closest in time.
K. Yeow, A. Gani, R. W. Ahmad, J. J. P. C. Rodrigues, and K. Ko, “Decentralized consensus for edge-centric internet of things: A review, taxonomy, and research issues,” IEEE Access , vol. 6, pp. 1513–1524, 2018
2018
Closest in time.
M. Conti, S. K. E, C. Lal, and S. Ruj, “A survey on security and privacy issues of bitcoin,” IEEE Communications Surveys Tutorials , pp. 1–1, May 2018, early access
2018
Closest in time.
S. Popov, “The tangle version 1.4.3,” IOTA Foundation, Tech. Rep., Apr. 2018
2018
Closest in time.
K. Wang, H. Yin, W. Quan, and G. Min, “Enabling collaborative edge computing for software defined vehicular networks,” IEEE Network , vol. 32, no. 5, pp. 112–117, Sep. 2018
2018
Closest in time.
D. Chatzopoulos, M. Ahmadi, S. Kosta, and P. Hui, “Flopcoin: A cryptocurrency for computation offloading,” IEEE Transactions on Mobile Computing , vol. 17, no. 5, pp. 1062–1075, May 2018
2018
Closest in time.
2018
Closest in time.
J. Wu, S. Guo, H. Huang, W. Liu, and Y. Xiang, “Information and communications technologies for sustainable development goals: State-of-the-art, needs and perspectives,” IEEE Communications Surveys Tutorials , vol. 20, no. 3, pp. 2389–2406, thirdquarter 2018
2018
Closest in time.
J. Zou, B. Ye, L. Qu, Y. Wang, M. A. Orgun, and L. Li, “A proof-of-trust consensus protocol for enhancing accountability in crowdsourcing services,” IEEE Transactions on Services Computing , pp. 1–1, 2018
2018
Closest in time.
J. Sousa, A. Bessani, and M. Vukolic, “A byzantine fault-tolerant ordering service for the hyperledger fabric blockchain platform,” in 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) , Luxembourg City, Luxembourg, Jun. 2018, pp. 51–58
2018
Closest in time.
X. Liu, W. Wang, D. Niyato, N. Zhao, and P. Wang, “Evolutionary game for mining pool selection in blockchain networks,” IEEE Wireless Communications Letters , pp. 1–1, Mar. 2018, early access
2018
Closest in time.
S. Feng, W. Wang, Z. Xiong, D. Niyato, P. Wang, and S. Wang, “On cyber risk management of blockchain networks: A game theoretic approach,” IEEE Transactions on Services Computing , pp. 1–1, Oct. 2018, early access
2018
Closest in time.
Z. Xiong, S. Feng, W. Wang, D. Niyato, P. Wang, and Z. Han, “Cloud/fog computing resource management and pricing for blockchain networks,” IEEE Internet of Things Journal , pp. 1–1, 2018, early access
2018
Closest in time.
Y. Jiao, P. Wang, D. Niyato, and Z. Xiong, “Social welfare maximization auction in edge computing resource allocation for mobile blockchain,” in 2018 IEEE International Conference on Communications (ICC) , Kansas City, Kansas, May 2018
2018
Closest in time.
B. David, P. Gaži, A. Kiayias, and A. Russell, “Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain,” in Advances in Cryptology – EUROCRYPT 2018 , Tel Aviv, Israel, Apr. 2018, pp. 66–98
2018
Closest in time.
“Proof of authority chains,” Jan. 2018. [Online]. Available: https://github.com/paritytech/parity
2018
Closest in time.
2018
Closest in time.
E. Kokoris Kogias, P. S. Jovanovic, L. Gasser, N. Gailly, E. Syta, and B. A. Ford, “Omniledger: A secure, scale-out, decentralized ledger via sharding,” in 2018 IEEE Symposium on Security and Privacy (SP) , San Francisco, CA, May 2018, pp. 583–598
2018
Closest in time.
M. Zamani, M. Movahedi, and M. Raykova, “Rapidchain: Scaling blockchain via full sharding,” IACR Cryptology ePrint Archive, Report 2018/460, 2018, https://eprint.iacr.org/2018/460
2018
Closest in time.
2018
Closest in time.
R. Li, T. Song, B. Mei, H. Li, X. Cheng, and L. Sun, “Blockchain for large-scale internet of things data storage and protection,” IEEE Transactions on Services Computing , pp. 1–1, Jul. 2018, early access
2018
Closest in time.
W. Wang, D. Niyato, P. Wang, and A. Leshem, “Decentralized caching for content delivery based on blockchain: A game theoretic perspective,” in 2018 IEEE International Conference on Communications (ICC) , Kansas City, USA, May 2018, pp. 1–6
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
K. Kotobi and S. G. Bilen, “Secure blockchains for dynamic spectrum access: A decentralized database in moving cognitive radio networks enhances security and user access,” IEEE Vehicular Technology Magazine , vol. 13, no. 1, pp. 32–39, Mar. 2018
2018
Closest in time.
Z. Yang, K. Yang, L. Lei, K. Zheng, and V. C. M. Leung, “Blockchain-based decentralized trust management in vehicular networks,” IEEE Internet of Things Journal , pp. 1–1, May 2018, early access
2018
Closest in time.
Z. Chen, S. Chen, H. Xu, and B. Hu, “A security authentication scheme of 5g ultra-dense network based on block chain,” IEEE Access , pp. 1–1, Sep. 2018, early access
2018
Closest in time.
P. K. Sharma, M. Chen, and J. H. Park, “A software defined fog node based distributed blockchain cloud architecture for iot,” IEEE Access , vol. 6, pp. 115–124, 2018
2018
Closest in time.
S. Feng, W. Wang, D. Niyato, D. I. Kim, and P. Wang, “Competitive data trading in Wireless-Powered internet of things (IoT) crowdsensing systems with blockchain,” in 2018 IEEE International Conference on Communication Systems , Chengdu, China, Dec. 2018
2018
Closest in time.
J. Wang, M. Li, Y. He, H. Li, K. Xiao, and C. Wang, “A blockchain based privacy-preserving incentive mechanism in crowdsensing applications,” IEEE Access , vol. 6, pp. 17 545–17 556, 2018
2018
Closest in time.
N. Z. Aitzhan and D. Svetinovic, “Security and privacy in decentralized energy trading through multi-signatures, blockchain and anonymous messaging streams,” IEEE Transactions on Dependable and Secure Computing , vol. 15, no. 5, pp. 840–852, Sep. 2018
2018
Closest in time.
Z. Li, J. Kang, R. Yu, D. Ye, Q. Deng, and Y. Zhang, “Consortium blockchain for secure energy trading in industrial internet of things,” IEEE Transactions on Industrial Informatics , vol. 14, no. 8, pp. 3690–3700, Aug 2018
2018
Closest in time.
Z. Su, Y. Wang, Q. Xu, M. Fei, Y. Tian, and N. Zhang, “A secure charging scheme for electric vehicles with smart communities in energy blockchain,” IEEE Internet of Things Journal , pp. 1–1, 2018, early access
2018
Closest in time.
N. C. Luong, Z. Xiong, P. Wang, and D. Niyato, “Optimal auction for edge computing resource management in mobile blockchain networks: A deep learning approach,” in 2018 IEEE International Conference on Communications (ICC) , Kansas City, Kansas, May 2018, pp. 1–6
2018
Closest in time.
Z. Xiong, Y. Zhang, D. Niyato, P. Wang, and Z. Han, “When mobile blockchain meets edge computing,” IEEE Communications Magazine , vol. 56, no. 8, pp. 33–39, Aug. 2018
2018
Closest in time.
M. Liu, R. Yu, Y. Teng, V. C. M. Leung, and M. Song, “Computation offloading and content caching in wireless blockchain networks with mobile edge computing,” IEEE Transactions on Vehicular Technology , pp. 1–1, 2018, early access
2018
Closest in time.
K. Suankaewmanee, D. T. Hoang, D. Niyato, S. Sawadsitang, P. Wang, and Z. Han, “Performance analysis and application of mobile blockchain,” in 2018 International Conference on Computing, Networking and Communications (ICNC) , Maui, Hawaii, Mar. 2018, pp. 642–646
2018
Closest in time.
2018
Closest in time.
M. Mohammadi, A. Al-Fuqaha, S. Sorour, and M. Guizani, “Deep learning for iot big data and streaming analytics: A survey,” IEEE Communications Surveys Tutorials , pp. 1–1, 2018, early access
2018
Closest in time.
2018
Closest in time.