This repository has been archived by the owner on Jan 26, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathbibliography.bib
701 lines (609 loc) · 28.3 KB
/
bibliography.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
@inproceedings{de2022hierarchical,
title={Hierarchical Consensus: A Horizontal Scaling Framework for Blockchains},
author={de la Rocha, Alfonso and Kokoris-Kogias, Lefteris and Soares, Jorge M and Vukoli\'c, Marko},
booktitle={5th International Symposium on Foundations and Applications of Blockchain 2022 (FAB 2022)},
volume={101},
pages={3},
year={2022},
}
@inproceedings{Narwahl,
author = {George Danezis and
Lefteris Kokoris{-}Kogias and
Alberto Sonnino and
Alexander Spiegelman},
editor = {Y{\'{e}}rom{-}David Bromberg and
Anne{-}Marie Kermarrec and
Christos Kozyrakis},
title = {Narwhal and Tusk: a DAG-based mempool and efficient {BFT} consensus},
booktitle = {EuroSys '22: Seventeenth European Conference on Computer Systems,
Rennes, France, April 5 - 8, 2022},
pages = {34--50},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3492321.3519594},
doi = {10.1145/3492321.3519594},
timestamp = {Wed, 13 Apr 2022 13:48:01 +0200},
biburl = {https://dblp.org/rec/conf/eurosys/DanezisKSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{ISS,
author = {Chrysoula Stathakopoulou and
Matej Pavlovic and
Marko Vukolic},
editor = {Y{\'{e}}rom{-}David Bromberg and
Anne{-}Marie Kermarrec and
Christos Kozyrakis},
title = {State machine replication scalability made simple},
booktitle = {EuroSys '22: Seventeenth European Conference on Computer Systems,
Rennes, France, April 5 - 8, 2022},
pages = {17--33},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3492321.3519579},
doi = {10.1145/3492321.3519579},
timestamp = {Wed, 13 Apr 2022 13:48:01 +0200},
biburl = {https://dblp.org/rec/conf/eurosys/StathakopoulouP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@InProceedings{Sok-L2,
author="Gudgeon, Lewis
and Moreno-Sanchez, Pedro
and Roos, Stefanie
and McCorry, Patrick
and Gervais, Arthur",
editor="Bonneau, Joseph
and Heninger, Nadia",
title="SoK: Layer-Two Blockchain Protocols",
booktitle="Financial Cryptography and Data Security",
year="2020",
publisher="Springer International Publishing",
address="Cham",
pages="201--226"
}
@article{Vukolic21,
author = {Marko Vukoli\'c},
title = {On the Future of Decentralized Computing},
journal = {Bull. {EATCS}},
volume = {135},
year = {2021},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/682},
timestamp = {Mon, 24 Oct 2022 17:32:05 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Vukolic21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Vukolic15,
author = {Marko Vukoli\'c},
editor = {Jan Camenisch and
Dogan Kesdogan},
title = {The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. {BFT}
Replication},
booktitle = {Open Problems in Network Security - {IFIP} {WG} 11.4 International
Workshop, iNetSec 2015, Zurich, Switzerland, October 29, 2015, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9591},
pages = {112--125},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-39028-4\_9},
doi = {10.1007/978-3-319-39028-4\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/ifip11-4/Vukolic15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{nakamoto2008bitcoin,
author = {Satoshi Nakamoto},
title = {Bitcoin: A Peer-to-Peer Electronic Cash System},
year = {2008},
month = {Dec},
url = {https://bitcoin.org/bitcoin.pdf}
}
@article{IBC,
title={The interblockchain communication protocol: An overview},
author={Goes, Christopher},
journal={arXiv preprint arXiv:2006.15918},
year={2020}
}
@misc{glossary,
title = {{IPC Glossary}},
author={ConsensusLab Research Team},
howpublished = "\url{https://docs.google.com/document/d/15pA7ahjeA-HYOl8Pxj0n6PxEswYlRVrZ112MJuRR0fY/edit?usp=sharing}",
}
@inproceedings{keidar2021DAG,
author = {Idit Keidar and
Eleftherios Kokoris{-}Kogias and
Oded Naor and
Alexander Spiegelman},
editor = {Avery Miller and
Keren Censor{-}Hillel and
Janne H. Korhonen},
title = {All You Need is {DAG}},
booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, July 26-30, 2021},
pages = {165--175},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3465084.3467905},
}
@inproceedings{spiegelman2022Bullshark,
author = {Alexander Spiegelman and
Neil Giridharan and
Alberto Sonnino and
Lefteris Kokoris{-}Kogias},
editor = {Heng Yin and
Angelos Stavrou and
Cas Cremers and
Elaine Shi},
title = {Bullshark: {DAG} {BFT} Protocols Made Practical},
booktitle = {Proceedings of the 2022 {ACM} {SIGSAC} Conference on Computer and
Communications Security, {CCS} 2022, Los Angeles, CA, USA, November
7-11, 2022},
pages = {2705--2718},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3548606.3559361},
doi = {10.1145/3548606.3559361},
timestamp = {Sat, 17 Dec 2022 01:15:29 +0100},
biburl = {https://dblp.org/rec/conf/ccs/SpiegelmanGSK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Lu2020Dumbo,
author = {Yuan Lu and
Zhenliang Lu and
Qiang Tang and
Guiling Wang},
editor = {Yuval Emek and
Christian Cachin},
title = {Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine
Agreement, Revisited},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {129--138},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405707},
doi = {10.1145/3382734.3405707},
timestamp = {Tue, 16 Nov 2021 18:10:49 +0100},
biburl = {https://dblp.org/rec/conf/podc/LuL0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Lu2022Dumbo,
author = {Yuan Lu and
Zhenliang Lu and
Qiang Tang},
editor = {Heng Yin and
Angelos Stavrou and
Cas Cremers and
Elaine Shi},
title = {Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined
{BFT}},
booktitle = {Proceedings of the 2022 {ACM} {SIGSAC} Conference on Computer and
Communications Security, {CCS} 2022, Los Angeles, CA, USA, November
7-11, 2022},
pages = {2159--2173},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3548606.3559346},
doi = {10.1145/3548606.3559346},
timestamp = {Sat, 17 Dec 2022 01:15:29 +0100},
biburl = {https://dblp.org/rec/conf/ccs/0001L022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Lu2022Bolt,
author = {Yuan Lu and
Zhenliang Lu and
Qiang Tang},
editor = {Heng Yin and
Angelos Stavrou and
Cas Cremers and
Elaine Shi},
title = {Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined
{BFT}},
booktitle = {Proceedings of the 2022 {ACM} {SIGSAC} Conference on Computer and
Communications Security, {CCS} 2022, Los Angeles, CA, USA, November
7-11, 2022},
pages = {2159--2173},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3548606.3559346},
doi = {10.1145/3548606.3559346},
timestamp = {Sat, 17 Dec 2022 01:15:29 +0100},
biburl = {https://dblp.org/rec/conf/ccs/0001L022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{aptoslabs,
title = {Aptos Labs},
howpublished = {\url{https://aptoslabs.com/}},
note = {Accessed: March 24, 2023}
}
@misc{sui,
title = {SUI},
howpublished = {\url{https://sui.io/}},
note = {Accessed: March 24, 2023}
}
@misc{hedera,
title = {Hedera Hashgraph},
howpublished = {\url{https://hedera.com/}},
note = {Accessed: March 24, 2023}
}
@inproceedings {kalodner2018arbitrum,
author = {Harry Kalodner and Steven Goldfeder and Xiaoqi Chen and S. Matthew Weinberg and Edward W. Felten},
title = {Arbitrum: Scalable, private smart contracts},
booktitle = {27th USENIX Security Symposium (USENIX Security 18)},
year = {2018},
isbn = {978-1-939133-04-5},
address = {Baltimore, MD},
pages = {1353--1370},
url = {https://www.usenix.org/conference/usenixsecurity18/presentation/kalodner},
publisher = {USENIX Association},
month = aug,
}
@article{nazirkhanova2021information,
title={Information dispersal with provable retrievability for rollups},
author={Nazirkhanova, Kamilla and Neu, Joachim and Tse, David},
journal={arXiv preprint arXiv:2111.12323},
year={2021}
}
@inproceedings{zamani2018rapidchain,
author = {Zamani, Mahdi and Movahedi, Mahnush and Raykova, Mariana},
title = {RapidChain: Scaling Blockchain via Full Sharding},
year = {2018},
isbn = {9781450356930},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3243734.3243853},
doi = {10.1145/3243734.3243853},
abstract = {A major approach to overcoming the performance and scalability limitations of current blockchain protocols is to use sharding which is to split the overheads of processing transactions among multiple, smaller groups of nodes. These groups work in parallel to maximize performance while requiring significantly smaller communication, computation, and storage per node, allowing the system to scale to large networks. However, existing sharding-based blockchain protocols still require a linear amount of communication (in the number of participants) per transaction, and hence, attain only partially the potential benefits of sharding. We show that this introduces a major bottleneck to the throughput and latency of these protocols. Aside from the limited scalability, these protocols achieve weak security guarantees due to either a small fault resiliency (e.g., 1/8 and 1/4) or high failure probability, or they rely on strong assumptions (e.g., trusted setup) that limit their applicability to mainstream payment systems. We propose RapidChain, the first sharding-based public blockchain protocol that is resilient to Byzantine faults from up to a 1/3 fraction of its participants, and achieves complete sharding of the communication, computation, and storage overhead of processing transactions without assuming any trusted setup. RapidChain employs an optimal intra-committee consensus algorithm that can achieve very high throughputs via block pipelining, a novel gossiping protocol for large blocks, and a provably-secure reconfiguration mechanism to ensure robustness. Using an efficient cross-shard transaction verification technique, our protocol avoids gossiping transactions to the entire network. Our empirical evaluations suggest that RapidChain can process (and confirm) more than 7,300 tx/sec with an expected confirmation latency of roughly 8.7 seconds in a network of 4,000 nodes with an overwhelming time-to-failure of more than 4,500 years.},
booktitle = {Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security},
pages = {931–948},
numpages = {18},
keywords = {sharding, public blockchain protocols, distributed consensus},
location = {Toronto, Canada},
series = {CCS '18}
}
@inproceedings{Leftheris2018Omniledger,
author={Kokoris-Kogias, Eleftherios and Jovanovic, Philipp and Gasser, Linus and Gailly, Nicolas and Syta, Ewa and Ford, Bryan},
booktitle={2018 IEEE Symposium on Security and Privacy (SP)},
title={OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding},
year={2018},
volume={},
number={},
pages={583-598},
doi={10.1109/SP.2018.000-5}}
@inproceedings{Luu2016Shards,
author = {Luu, Loi and Narayanan, Viswesh and Zheng, Chaodong and Baweja, Kunal and Gilbert, Seth and Saxena, Prateek},
title = {A Secure Sharding Protocol For Open Blockchains},
year = {2016},
isbn = {9781450341394},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2976749.2978389},
doi = {10.1145/2976749.2978389},
abstract = {Cryptocurrencies, such as Bitcoin and 250 similar alt-coins, embody at their core a blockchain protocol --- a mechanism for a distributed network of computational nodes to periodically agree on a set of new transactions. Designing a secure blockchain protocol relies on an open challenge in security, that of designing a highly-scalable agreement protocol open to manipulation by byzantine or arbitrarily malicious nodes. Bitcoin's blockchain agreement protocol exhibits security, but does not scale: it processes 3--7 transactions per second at present, irrespective of the available computation capacity at hand.In this paper, we propose a new distributed agreement protocol for permission-less blockchains called ELASTICO. ELASTICO scales transaction rates almost linearly with available computation for mining: the more the computation power in the network, the higher the number of transaction blocks selected per unit time. ELASTICO is efficient in its network messages and tolerates byzantine adversaries of up to one-fourth of the total computational power. Technically, ELASTICO uniformly partitions or parallelizes the mining network (securely) into smaller committees, each of which processes a disjoint set of transactions (or "shards"). While sharding is common in non-byzantine settings, ELASTICO is the first candidate for a secure sharding protocol with presence of byzantine adversaries. Our scalability experiments on Amazon EC2 with up to $1, 600$ nodes confirm ELASTICO's theoretical scaling properties.},
booktitle = {Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security},
pages = {17–30},
numpages = {14},
keywords = {sharding, bitcoin, consensus protocol},
location = {Vienna, Austria},
series = {CCS '16}
}
@ARTICLE{Yu2020Survey,
author={Yu, Guangsheng and Wang, Xu and Yu, Kan and Ni, Wei and Zhang, J. Andrew and Liu, Ren Ping},
journal={IEEE Access},
title={Survey: Sharding in Blockchains},
year={2020},
volume={8},
number={},
pages={14155-14181},
doi={10.1109/ACCESS.2020.2965147}}
@misc{avarikioti2021divide,
title={Divide and Scale: Formalization of Distributed Ledger Sharding Protocols},
author={Georgia Avarikioti and Eleftherios Kokoris-Kogias and Roger Wattenhofer},
year={2021},
eprint={1910.10434},
archivePrefix={arXiv},
primaryClass={cs.DC}
}
@inproceedings{androulaki2018Channels,
author="Androulaki, Elli
and Cachin, Christian
and De Caro, Angelo
and Kokoris-Kogias, Eleftherios",
editor="Lopez, Javier
and Zhou, Jianying
and Soriano, Miguel",
title="Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains",
booktitle="Computer Security",
year="2018",
publisher="Springer International Publishing",
address="Cham",
pages="111--131",
abstract="Sharding, or partitioning the system's state so that different subsets of participants handle it, is a proven approach to building distributed systems whose total capacity scales horizontally with the number of participants. Many distributed ledgers have adopted this approach to increase their performance, however, they focus on the permissionless setting that assumes the existence of a strong adversary. In this paper, we deploy channels for permissioned blockchains. Our first contribution is to adapt sharding on asset-management applications for the permissioned setting, while preserving liveness and safety even on transactions spanning across-channels. Our second contribution is to leverage channels as a confidentiality boundary, enabling different organizations and consortia to preserve their privacy within their channels and still be part of a bigger collaborative ecosystem. To make our system concrete we map it on top of Hyperledger Fabric.",
isbn="978-3-319-99073-6"
}
@inproceedings{wang2019monoxide,
title={Monoxide: Scale out Blockchains with Asynchronous Consensus Zones.},
author={Wang, Jiaping and Wang, Hao},
booktitle={NSDI},
volume={2019},
pages={95--112},
year={2019}
}
@misc{albassam2017chainspace,
title={Chainspace: A Sharded Smart Contracts Platform},
author={Mustafa Al-Bassam and Alberto Sonnino and Shehar Bano and Dave Hrycyszyn and George Danezis},
year={2017},
eprint={1708.03778},
archivePrefix={arXiv},
primaryClass={cs.CR}
}
@inproceedings{hong2021pyramid,
author={Hong, Zicong and Guo, Song and Li, Peng and Chen, Wuhui},
booktitle={IEEE INFOCOM 2021 - IEEE Conference on Computer Communications},
title={Pyramid: A Layered Sharding Blockchain System},
year={2021},
volume={},
number={},
pages={1-10},
doi={10.1109/INFOCOM42981.2021.9488747}}
@inproceedings{dziembowski2018general,
author = {Dziembowski, Stefan and Faust, Sebastian and Host\'{a}kov\'{a}, Kristina},
title = {General State Channel Networks},
year = {2018},
isbn = {9781450356930},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3243734.3243856},
doi = {10.1145/3243734.3243856},
abstract = {One of the fundamental challenges that hinder further adaption of decentralized cryptocurrencies is scalability. Because current cryptocurrencies require that all transactions are processed and stored on a distributed ledger -- the so-called blockchain -- transaction throughput is inherently limited. An important proposal to significantly improve scalability are off-chain protocols, where the massive amount of transactions is executed without requiring the costly interaction with the blockchain. Examples of off-chain protocols include payment channels and networks, which are currently deployed by popular cryptocurrencies such as Bitcoin and Ethereum. A further extension of payment networks envisioned for cryptocurrencies are so-called state channel networks. In contrast to payment networks that only support off-chain payments between users, state channel networks allow execution of arbitrary complex smart contracts. The main contribution of this work is to give the first full specification for general state channel networks. Moreover, we provide formal security definitions and prove the security of our construction against powerful adversaries. An additional benefit of our construction is the use of channel virtualization, which further reduces latency and costs in complex channel networks.},
booktitle = {Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security},
pages = {949–966},
numpages = {18},
keywords = {virtualization, provable secure protocols, blockchain protocols, state channel networs},
location = {Toronto, Canada},
series = {CCS '18}
}
@misc{poon2016bitcoin,
title={The Bitcoin lightning network: Scalable off-chain instant payments},
author={Poon, Joseph and Dryja, Thaddeus},
year={2016},
institution={Bitcoin Lightning},
url={https://www.bitcoinlightning.com/wp-content/uploads/2018/03/lightning-network-paper.pdf},
}
@inproceedings{decker2015fast,
title={A fast and scalable payment network with bitcoin duplex micropayment channels},
author={Decker, Christian and Wattenhofer, Roger},
booktitle={Symposium on Self-Stabilizing Systems},
year={2015},
}
@inproceedings{burchert2018scalable,
title={Scalable funding of Bitcoin micropayment channel networks},
author={Burchert, Conrad and Decker, Christian and Wattenhofer, Roger},
booktitle={Royal Society open science},
year={2018},
}
@misc{poon2017plasma,
title={Plasma: Scalable autonomous smart contracts},
author={Poon, Joseph and Buterin, Vitalik},
institution={Plasma},
url={https://plasma.io/plasma.pdf},
year={2017}
}
@misc{BOLT,
title = {{Basis of lightning technology (BOLTs)}},
author = {Andrew Samokhvalov and Joseph Poon and Olaoluwa Osuntokun},
url = {https://github.com/lightningnetwork/lightning-rfc},
year = 2018
}
@misc{lnd2018,
title = {The Lightning Network Daemon},
author = {Andrew Samokhvalov and Joseph Poon and Olaoluwa Osuntokun},
url = {"https://github.com/lightningnetwork/lnd"},
year = {2018}
}
@misc{network2023raiden,
title={The raiden network},
url={https://raiden.network},
year={2019},
}
@misc{Validium,
title={Validium},
url={https://ethereum.org/en/developers/docs/scaling/validium/},
year={2023}
}
@misc{Lurkpaper,
author = {Nada Amin and John Burnham and François Garillot and Rosario Gennaro and Chhi'mèd Künzang and Daniel Rogozin and Cameron Wong},
title = {LURK: Lambda, the Ultimate Recursive Knowledge},
howpublished = {Cryptology ePrint Archive, Paper 2023/369},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/369}},
url = {https://eprint.iacr.org/2023/369}
}
@INPROCEEDINGS{PoSsidechains,
author={Gaži, Peter and Kiayias, Aggelos and Zindros, Dionysis},
booktitle={2019 IEEE Symposium on Security and Privacy (SP)},
title={Proof-of-Stake Sidechains},
year={2019},
volume={},
number={},
pages={139-156},
doi={10.1109/SP.2019.00040}}
@Misc{clightning2023,
author = {{Elements Project}},
title = {c-lightning -- a Lightning Network implementation in {C}},
url = {https://github.com/ElementsProject/lightning},
note = {Accessed on March 24, 2023}
}
@misc{eclair,
Author = {ACINQ},
Title = { Eclair GitHub Repository},
year = {2008},
url = {https://github.com/ACINQ/eclair}
}
@INPROCEEDINGS{platypus2019ranchalpedrosa, author={Ranchal-Pedrosa, Alejandro and Gramoli, Vincent}, booktitle={IEEE NCA}, title={Platypus: Offchain Protocol Without Synchrony}, year={2019}, volume={}, number={}, options = {skipbib}}
@misc{back2014enabling,
title={Enabling blockchain innovations with pegged sidechains},
author={Back, Adam and Corallo, Matt and Dashjr, Luke and Friedenbach, Mark and Maxwell, Gregory and Miller, Andrew and Poelstra, Andrew and Tim{\'o}n, Jorge and Wuille, Pieter},
url = {https://blockstream.com/sidechains.pdf},
institution={Blockstream},
year={2014},
}
@inproceedings{gazi2019proof,
title={Proof-of-stake sidechains},
author={Ga{\v{z}}i, Peter and Kiayias, Aggelos and Zindros, Dionysis},
booktitle={S\&P},
year={2019},
}
@misc{polygon-zkevm,
author = {Polygon Technology},
title = {Polygon Launches zkEVM, A New Ethereum-Compatible Scaling Solution},
year = {2022},
howpublished = {\url{https://polygon.technology/polygon-zkevm}},
note = {Accessed: March 24, 2023}
}
@misc{starkware,
author = {StarkWare},
title = {StarkWare},
year = {2022},
howpublished = {\url{https://starkware.co/}},
note = {Accessed: March 24, 2023}
}
@misc{sin7y,
title = {Sin7y},
howpublished = {\url{https://sin7y.org/}},
note = {Accessed: March 24, 2023}
}
@misc{matterlabs,
title = {Matter Labs},
howpublished = {\url{https://matter-labs.io/}},
note = {Accessed: March 24, 2023}
}
@misc{appliedzkp,
title = {Applied ZKP},
howpublished = {\url{https://appliedzkp.org/}},
note = {Accessed: March 24, 2023}
}
@misc{espressosys,
title = {Espresso},
howpublished = {\url{https://www.espressosys.com/}},
note = {Accessed: March 24, 2023}
}
@misc{rollmint,
title = {Celestia Documentation - Rollmint},
howpublished = {\url{https://docs.celestia.org/developers/rollmint/}},
note = {Accessed: March 24, 2023}
}
@misc{polkadotparachains,
title = {Parachains | Polkadot},
howpublished = {\url{https://polkadot.network/parachains/}},
note = {Accessed: March 24, 2023}
}
@misc{polygonpos,
title = {Polygon PoS},
howpublished = {\url{https://polygon.technology/solutions/polygon-pos}},
note = {Accessed: March 24, 2023}
}
@misc{polygonsupernets,
title = {Supernets},
howpublished = {\url{https://polygon.technology/supernets}},
note = {Accessed: March 24, 2023}
}
@misc{cosmosdocs,
title = {Cosmos Network Documentation},
howpublished = {\url{https://docs.cosmos.network/main}},
note = {Accessed: March 24, 2023}
}
@misc{avaxsubnets,
title = {Subnets | Avalanche},
howpublished = {\url{https://www.avax.network/subnets}},
note = {Accessed: March 24, 2023}
}
@misc{icp,
title = {How It Works - Internet Computer},
howpublished = {\url{https://internetcomputer.org/how-it-works}},
note = {Accessed: March 24, 2023}
}
@misc{filecoin,
title = {Filecoin},
howpublished = {\url{https://filecoin.io/}},
note = {Accessed: March 24, 2023}
}
@misc{trantor,
title = {Trantor: Modular Consensus for (not only) Filecoin IPC},
howpublished = {\url{https://hackmd.io/P59lk4hnSBKN5ki5OblSFg?view}},
note = {Accessed: March 24, 2023}
}
@misc{lotus,
title = {Lotus},
howpublished = {\url{https://lotus.filecoin.io/}},
note = {Accessed on March 24, 2023}
}
@misc{multiformats,
title = {Multiformats},
howpublished = {\url{https://multiformats.io/}},
note = {Accessed on March 24, 2023}
}
@misc{bitswap,
title = {Bitswap | IPFS Docs},
howpublished = {\url{https://docs.ipfs.tech/concepts/bitswap/}},
note = {Accessed on March 24, 2023}
}
@inproceedings{castro1999practical,
title={Practical byzantine fault tolerance},
author={Castro, Miguel and Liskov, Barbara and others},
booktitle={OsDI},
volume={99},
pages={173--186},
year={1999}
}
@inproceedings{wood2014ethereum,
title={Ethereum: A Secure Decentralised Generalised Transaction Ledger},
author={Wood, Gavin},
booktitle={Ethereum Project Yellow Paper},
year={2014}
}
@misc{l2beat,
title = {L2BEAT: Ethereum Layer 2s Analytics},
author = {{L2BEAT Team}},
howpublished = {\url{https://l2beat.com/}},
year = {2021},
note = {Accessed: March 30, 2023}
}
@article{thibault2022rollups,
author={Thibault, Louis Tremblay and Sarry, Tom and Hafid, Abdelhakim Senhaji},
journal={IEEE Access},
title={Blockchain Scaling Using Rollups: A Comprehensive Survey},
year={2022},
volume={10},
number={},
pages={93039-93054},
doi={10.1109/ACCESS.2022.3200051}}
@misc{vitalik2021trilemma,
Author = {Vitalik Buterin},
Title = {{ Why sharding is great: demystifying the technical properties}},
year = {2021},
url = {https://vitalik.ca/general/2021/04/07/sharding.html}
}
@inproceedings{Algorand,
author = {Gilad, Yossi and Hemo, Rotem and Micali, Silvio and Vlachos, Georgios and Zeldovich, Nickolai},
title = {Algorand: Scaling {B}yzantine Agreements for Cryptocurrencies},
booktitle= {SOSP},
year = {2017},
}
@inproceedings{azouvi2022Pikachu,
author = {Azouvi, Sarah and Vukoli\'{c}, Marko},
title = {Pikachu: Securing PoS Blockchains from Long-Range Attacks by Checkpointing into Bitcoin PoW Using Taproot},
year = {2022},
isbn = {9781450398794},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3560829.3563563},
doi = {10.1145/3560829.3563563},
abstract = {Blockchain systems based on a reusable resource, such as proof-of-stake (PoS), provide weaker security guarantees than those based on proof-of-work. Specifically, they are vulnerable to long-range attacks, where an adversary can corrupt prior participants in order to rewrite the full history of the chain. To prevent this attack on a PoS chain, we propose a protocol that checkpoints the state of the PoS chain to a proof-of-work blockchain such as Bitcoin. Our checkpointing protocol hence does not rely on any central authority. Our work uses Schnorr signatures and leverages Bitcoin recent Taproot upgrade, allowing us to create a checkpointing transaction of constant size. We argue for the security of our protocol and present an open-source implementation that was tested on the Bitcoin testnet.},
booktitle = {Proceedings of the 2022 ACM Workshop on Developments in Consensus},
pages = {53–65},
numpages = {13},
keywords = {long-range attack, blockchain, threshold signature, proof-of-stake},
location = {Los Angeles, CA, USA},
series = {ConsensusDay '22}
}