forked from dicg-workshop/dicg-workshop.github.io
-
Notifications
You must be signed in to change notification settings - Fork 0
/
closing.html~
781 lines (715 loc) · 34.6 KB
/
closing.html~
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
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<title>DICG 2020</title>
<meta content="width=device-width, initial-scale=1.0" name="viewport">
<meta content="" name="keywords">
<meta content="" name="description">
<!-- Favicons -->
<link href="img/favicon.png" rel="icon">
<link href="img/apple-touch-icon.png" rel="apple-touch-icon">
<!-- Bootstrap CSS File -->
<link href="lib/bootstrap/css/bootstrap.min.css" rel="stylesheet">
<!-- Libraries CSS Files -->
<link href="lib/font-awesome/css/font-awesome.min.css" rel="stylesheet">
<link href="lib/animate/animate.min.css" rel="stylesheet">
<link href="lib/ionicons/css/ionicons.min.css" rel="stylesheet">
<link href="lib/owlcarousel/assets/owl.carousel.min.css" rel="stylesheet">
<link href="lib/lightbox/css/lightbox.min.css" rel="stylesheet">
<!-- Main Stylesheet File -->
<link href="css/style.css" rel="stylesheet">
<!-- =======================================================
Theme Name: DevFolio
Theme URL: https://bootstrapmade.com/devfolio-bootstrap-portfolio-html-template/
Author: BootstrapMade.com
License: https://bootstrapmade.com/license/
======================================================= -->
</head>
<body id="page-top">
<!--/ Nav Star /-->
<nav class="navbar navbar-b navbar-trans navbar-expand-md fixed-top" id="mainNav">
<div class="container">
<!-- <a class="navbar-brand js-scroll" href="#page-top">DICG 2020</a> -->
<!-- <button class="navbar-toggler collapsed" type="button" data-toggle="collapse" data-target="#navbarDefault" -->
<!-- aria-controls="navbarDefault" aria-expanded="false" aria-label="Toggle navigation"> -->
<!-- <span></span> -->
<!-- <span></span> -->
<!-- <span></span> -->
<!-- </button> -->
<!-- <div class="navbar-collapse collapse justify-content-end" id="navbarDefault"> -->
<!-- <ul class="navbar-nav"> -->
<!-- <\!-- <li class="nav-item"> -\-> -->
<!-- <\!-- <a class="nav-link js-scroll active" href="#home">Home</a> -\-> -->
<!-- <\!-- </li> -\-> -->
<!-- <li class="nav-item"> -->
<!-- <a class="nav-link js-scroll" href="#about">About</a> -->
<!-- </li> -->
<!-- <li class="nav-item"> -->
<!-- <a class="nav-link js-scroll" href="#call">Call for Papers</a> -->
<!-- </li> -->
<!-- <li class="nav-item"> -->
<!-- <a class="nav-link js-scroll" href="#program">Program</a> -->
<!-- </li> -->
<!-- <li class="nav-item"> -->
<!-- <a class="nav-link js-scroll" href="#attendance">Attendance</a> -->
<!-- </li> -->
<!-- <li class="nav-item"> -->
<!-- <a class="nav-link js-scroll" href="#organization">Organization</a> -->
<!-- </li> -->
<!-- </ul> -->
<!-- </div> -->
</div>
</nav>
<!--/ Nav End /-->
<!--/ Intro Skew Star /-->
<div id="home" class="intro route bg-image" style="background-image: url(img/delft.jpg)">
<div class="overlay-itro"></div>
<div class="intro-content display-table">
<div class="table-cell">
<div class="container">
<!--<p class="display-6 color-d">Hello, world!</p>-->
<h1 class="intro-title-small mb-4">1st International Workshop on Distributed Infrastructure for Common Good</h1>
<h1 class="intro-title-warning">Session 1 will start at 16:40 (CET)</h1>
<!-- <h6 class="intro-title">7-11 December 2019, Delft, The Netherlands</h6> -->
<p class="clock"> <span id="clocktext" style="font-kerning:none"></span></p>
<div class="sessionsummary">
<h5 class="sessionhead">Session 3 <a>(Cooperation)</a></h5>
<ul class="paperlist">
<li class="chair">Session chair: Mark Jelasity</li>
<li>
<b>16:40 - 16:55 </b> -
<b>Gossiping with Append-Only Logs in Secure-Scuttlebutt</b>
<div class="title">
<p class="author">
Anne-Marie Kermarrec <a class="aff">(EPFL)</a>,
Erick Lavoie <a class="aff">(EPFL)</a>,
Christian Tschudin <a class="aff">(University of Basel)</a>
</p>
</div>
</li>
<li>
<b>16:55 - 17:10 </b> -
<b>Foundations of Peer-to-Peer Reputation</b>
<div class="title">
<p class="author">
Quinten Stokkink <a class="aff">(TU Delft)</a>,
Alexander Stannat <a class="aff">(TU Delft)</a>,
Johan Pouwelse <a class="aff">(TU Delft)</a>
</p>
</div>
</li>
<li>
<b>17:10 - 17:30 </b> -
<b>Session Discussion </b> <br/>
</li>
<li>
<b>17:30 - 17:40 </b> -
<b>Coffee Break </b> <br/>
</li>
<li class="warnweb">Check our web page for the details of papers: </li>
<li class="warnweb">dicg2020.github.io</li>
</ul>
</div>
<!-- <p class="intro-subtitle">Colocated with <a class="color-a" href="https://2020.middleware-conference.org/">Middleware 2020</a></p> -->
<!-- <p class="pt-3"><a class="btn btn-primary btn js-scroll px-4" href="#about" role="button">Learn More</a></p> -->
</div>
</div>
</div>
</div>
<!--/ Intro Skew End /-->
<section id="about" class="about-mf sect-pt4 route">
<div class="container">
<div class="row">
<div class="col-sm-12">
<div class="box-shadow-full">
<div class="row">
<div class="col-md-12">
<div class="about-me pt-4 pt-md-0">
<div class="title-box-2">
<!-- <h3 align="center"> -->
<!-- 1st International Workshop on -->
<!-- </h3> -->
<!-- <h2 align="center"> -->
<!-- Distributed Infrastructure for Common Good -->
<!-- </h2> -->
<!-- </div> -->
<!-- <h2> -->
<!-- 1st International Workshop on -->
<!-- </h2> -->
<!-- <div id="about" class="title-box-2"> -->
<!-- <h5 class="title-left"> -->
<!-- Distributed Infrastructure for Common Good -->
<!-- </h5> -->
<!-- </div> -->
<p class="lead">
The DICG20 workshop is co-located with <a href="https://2020.middleware-conference.org/">ACM/IFIP Middleware 2020</a>, which takes place
on December 8 online.
</p>
<!-- <p class="s-description"> -->
<p class="lead">
This workshop is focussed on distributed infrastructures that enable human interactions
and economic activity in general with a focus on the common good. Daily life is
transitioning to digital infrastructures, including friendships, education, employment,
health-care, finances, family connections, and more. These infrastructures
can contribute to the common good enabling us to work together to
improve the wellbeing of people in our society and the wider world.
</p>
<div class="title-box-2"></div>
<div id="call" class="title-box-2">
<h5 class="title-left">
Call for Papers
</h5>
</div>
<p class="lead">
Private ownership of infrastructures does not seem to solve the traditional problems
of Tragedy of Commons: pollution (spam and bot network on social media), over-exhaustion
of resources (net neutrality), and fairness (gig economy). Privatization of
digital commons also introduces the potential for monopolistic abuse, such as: stifled
innovation, price discriminations, and distorted market knowledge discovery. We aim
to explore within this workshop viable alternatives to 'winner-takes-all' platform
ecosystems. Failure of market mechanisms to address these issues
suggest that such infrastructures could be treated as commons. We
recognize the promising avenue of research build on Nobel laureate Ostroms idea that
commons is the third way to organize complex human cooperation, beyond capitalist
regulation or governmental regulations.
</p>
<p class="lead">
Scientific challenges include, but are not limited to: the Tragedy of the Commons
in such shared-resource systems, fake identities with Sybil attacks, robot economy,
trustworthiness in general, self-organizing machine learning, market infrastructures in
cashless society, and governance issues in decentralized systems.
</p>
<p class="lead">
This workshop focuses on the tools, frameworks, and algorithms to support the common good
in a distributed environment. Both theoretical work and experimental approaches are welcomed.
Reproducibility, open source and public datasets are endorsed. Each submission must clearly
contribute to the middleware community, to facilitate the development of applications by
providing higher-level abstractions for better programmability, performance, scalability, and security.
<!-- Research topics within the scope of this workshop are: -->
<!-- <b>distributed computing</b>, <b>fault-tolerance</b>, <b>gossip learning</b>, -->
<!-- <b>reputation systems</b>, <b>self-sovereign identity</b>, <b>peer-to-peer networks</b> -->
<!-- and <b>gossip protocols</b>. -->
</p>
<h5>Scope:</h5>
<p class="lead">
The topics of interest include, but are not limited to:
</p>
<ul>
<li>Distributed algorithms</li>
<li>Trust and reputation systems</li>
<li>Fault-tolerance</li>
<li>Gossip-based learning and behavioral models</li>
<li>Self-sovereign identity</li>
<li>Peer-to-peer networks</li>
<li>Game-theoretic approaches to tragedy of commons</li>
<li>Markets, mechanism design, and incentives</li>
<li>Computational social choice</li>
<li>Incentives for participants</li>
<li>Fairness in market systems</li>
<li>Decentralized governance</li>
</ul>
<h5>Important Dates:</h5>
<p class="lead">
<ul>
<li>Paper submissions: <b><del>September 21, 2020</del> <ins>September 22, 2020</ins></b> (AOE)</li>
<li>Notification of acceptance: <b><del>October 5, 2020</del> <ins>October 6, 2020</ins></b> (AOE)</li>
<li>Camera ready version: <b>October 15, 2020</b></li>
</ul>
</p>
<h5>Submission Guidelines:</h5>
<p class="lead">
Full papers can have a maximum length of 6 pages in the standard, 10pt <a href="https://www.acm.org/publications/proceedings-template" target="_blank" rel="noopener noreferrer">ACM SIGPLAN format</a>. The page limits include figures, tables, and references. All submitted papers will be judged through double-blind reviewing. Submissions will be handled through <a href="https://dicg20.hotcrp.com">HotCRP</a>.
</p>
<h5>Publication of Accepted Papers:</h5>
<p class="lead">
All accepted papers will appear in a Middleware 2020 companion proceedings, which will be available
in the ACM Digital Library prior to the workshop.
At least one of the authors will have to register for the workshop and present the paper.
You can register for the conference through <a href="https://www.aanmelder.nl/116906/register"><b>Middleware 2020 registration page</b></a>.
</p>
<div class="title-box-2"></div>
<div id="program" class="title-box-2">
<h5 class="title-left">
Program
</h5>
</div>
<!--
<p class="lead">
<b>Keynote</b>
</p>
<ul>
<li><b>Pēteris Zilgalvis, J.D.</b><br/>
Head of Unit, Digital Innovation and Blockchain<br/>
Digital Single Market Directorate<br/>
DG CONNECT<br/>
Co-Chair, FinTech Task Force<br/>
European Commission </li>
</ul>
<p class="lead">
<b>Technical Programme</b>
</p>
<ul>
<li>TBD</li>
</ul>
<p class="lead">
<b>Accepted Papers</b>
</p>
<ul class="paperlist">
<li><b>ConTrib: Universal and Decentralized Accounting in Shared-Resource Systems</b> <br/> <i> Martijn de Vos, Johan Pouwelse</i></li>
<li><b>Blockchains for the Governance of Common Goods</b> <br/> <i> Philemon Poux , Primavera de Filippi, Simona Ramos</i></li>
<li><b>Towards a Scalable Censorship-Resistant Overlay Network based on WebRTC Covert</b> <br/> <i> Diogo Barradas, Nuno Santos</i></li>
<li><b>Foundations of Peer-to-Peer Reputation</b> <br/> <i> Quinten Stokkink, Alexander Stannat, Johan Pouwelse</i></li>
<li><b>Modeling Peer-to-Peer Connections over a Smartphone Network</b> <br/> <i> Árpád Berta, Zoltán Szabó, Márk Jelasity</i></li>
<li><b>Gossiping with Append-Only Logs in Secure-Scuttlebutt</b> <br/> <i>Anne-Marie Kermarrec, Erick Lavoie, Christian Tschudin</i></li>
<li><b>Decentralized machine learning using compressed push-pull averaging</b> <br/> <i> Gábor Danner, István Hegedűs, Márk Jelasity</i></li>
<li><b>Towards the Science of Essential Decentralised Infrastructures </b> [Invited paper] <br/> <i>Johan Pouwelse</i></li>
</ul>
-->
<h5 class="sessionhead">Opening</h5>
<ul class="paperlist">
<li class="chair">Session chair: Johan Pouwelse </li>
<li>
<b>13:00 - 13:05 </b> -
<b>Welcome </b> <br/>
</li>
<li>
<b>13:05 - 13:30 </b> -
<b>Keynote: Pēteris Zilgalvis </b> <br/>
<div class="title">
<p class="author">
Pēteris Zilgalvis <a class="aff">(Head of Unit, Digital Innovation and Blockchain, European Commission)</a>
</p>
<details>
<summary>Short Bio</summary>
<div class="row">
<div class="col-sm-6 col-md-3">
<div class="about-img">
<img src="img/peteris_zilgalvis.jpg" class="img-fluid rounded b-shadow-a" alt=""/>
</div>
</div>
<div class="col-sm-6 col-md-8">
<div class="about-info">
<p>
Pēteris Zilgalvis is the Head of Unit for Digital Innovation and Blockchain in the Digital Single Market Directorate in DG CONNECT and is the Co-Chair of the European Commission FinTech Task Force. He was the Visiting EU Fellow at St. Antony's College, University of Oxford for 2013-14, where was an Associate of the Political Economy of Financial Markets Programme. From 1997 to 2005, he was Deputy Head of the Bioethics Department of the Council of Europe, in its Directorate General of Legal Affairs. In addition, he has held various positions in the Latvian civil service (Ministry of Foreign Affairs, Ministry of Environment).
</p>
<p>
He was Senior Environmental Law Advisor to the World Bank/Russian Federation Environmental Management Project and was Regional Environmental Specialist for the Baltic Countries at the World Bank. He has been a member of the California State Bar since 1991, completed his J.D. at the University of Southern California, his B.A. in Political Science Cum Laude at UCLA, the High Potentials Leadership Program at Harvard Business School.
</p>
</div>
</div>
</div>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>13:30 - 13:45 </b> -
<b>Keynote Discussion </b> <br/>
</li>
<li>
<b>13:45 - 13:55 </b> -
<b>Coffee Break </b> <br/>
</li>
</ul>
<h5 class="sessionhead">Session 1 <a>(Governance and Accounting of Commons)</a></h5>
<ul class="paperlist">
<li class="chair">Session chair: Alberto Montresor</li>
<li>
<b>14:00 - 14:15 </b> -
<b>Blockchains for the Governance of Common Goods</b>
<div class="title">
<p class="author">
Philemon Poux <a class="aff">(CERSA/CRED/ENPC)</a>,
Primavera de Filippi <a class="aff">(CNRS/Berkman Klein Center)</a>,
Simona Ramos <a class="aff">(Universitat Pompeu Fabra/Nokia Bell Labs)</a>
</p>
<details>
<summary>Abstract</summary>
<p>This paper analyses the use of blockchain technology to support the governance of commons-pool resources, as studied by Elinor Ostrom. It argues that the technological guarantees of blockchain technology—in terms of ex-ante automation and ex-post verification—can replace the traditional requirements of monitoring and sanctioning. Despite its own limitations and challenges, this novel approach to governance could provide new opportunities for experimentation in the context of commons-pool resources.
</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>14:15 - 14:30 </b> -
<b>ConTrib: Universal and Decentralized Accounting in Shared-Resource Systems</b>
<div class="title">
<p class="author">
Martijn de Vos <a class="aff">(TU Delft)</a>,
Johan Pouwelse <a class="aff">(TU Delft)</a>
</p>
<details>
<summary>Abstract</summary>
<p>Preventing the abuse of resources is a crucial requirement in shared-resource systems.
This concern can be addressed through a centralized gatekeeper, yet it enables manipulation by the gatekeeper itself.
We present ConTrib, a decentralized mechanism for tracking resource usage across different shared-resource systems.
In ConTrib, participants maintain a <em>personal ledger</em> with tamper-proof <em>records</em>.
A record describes a resource consumption or contribution and links to other records.
Fraud, maintaining multiple copies of a personal ledger, is detected by users themselves through the continuous exchange of records and by validating their consistency against known ones.
We implement ConTrib and run experiments.
Our evaluation with up to 1'000 instances reveals that fraud can be detected within 22 seconds and with moderate bandwidth usage.
To demonstrate the applicability of our work, we deploy ConTrib in a Tor-like overlay and show how resource abuse by free-riders is effectively deterred.
This longitudinal, large-scale trial has resulted in over 137 million records, created by more than 86'000 volunteers.</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>14:30 - 14:50 </b> -
<b>Session Discussion </b> <br/>
</li>
<li>
<b>14:50 - 15:00 </b> -
<b>Coffee Break </b> <br/>
</li>
</ul>
<h5 class="sessionhead">Session 2 <a>(Infrastructure for Commons)</a></h5>
<ul class="paperlist">
<li class="chair">Session chair: Georgy Ishmaev</li>
<li>
<b>15:00 - 15:15 </b> -
<b>Towards a Scalable Censorship-Resistant Overlay Network based on WebRTC Covert</b>
<div class="title">
<p class="author">
Diogo Barradas <a class="aff">(INESC-ID, Universidade de Lisboa)</a>,
Nuno Santos <a class="aff">(INESC-ID, Universidade de Lisboa)</a>
</p>
<details>
<summary>Abstract</summary>
<p>
In many regions of the world, nation-states enforce Internet censorship policies that prevent unrestricted access to information and services by their citizens. Over the years, many censorship circumvention tools have been proposed which, however, require either the deployment of a dedicated infrastructure within trusted ISPs, or are vulnerable to state-of-the-art traffic analysis techniques. To fill this gap, we propose to build a practical censorship-circumvention service that exhibits strong resistance against traffic analysis attacks. By relying on a recent proposal for creating covert channels through WebRTC streams, we discuss the design of a distributed system named Censorship-Resistant Overlay Network (CRON). CRON aims at offering to the users located in censored regions a set of services that allow them to locate proxies positioned in the free Internet region, and set up secure covert tunnels for accessing arbitrary sites on the Internet. We present the key challenges and explore the solutions in making CRON robust against state-level attacks.
</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>15:15 - 15:30 </b> -
<b>Modeling Peer-to-Peer Connections over a Smartphone Network</b>
<div class="title">
<p class="author">
Árpád Berta <a class="aff">(University of Szeged)</a>,
Zoltán Szabó <a class="aff">(University of Szeged)</a>,
Márk Jelasity <a class="aff">(University of Szeged)</a>
</p>
<details>
<summary>Abstract</summary>
<p>Smartphones offer a natural platform for building decentralized systems for the
common good.
A very important problem in such systems is understanding the limitations
of building a peer-to-peer (P2P) overlay network, given that today's networking
infrastructure is designed with centralized services in mind.
We performed measurements over smartphones over several years and collected
large amounts of data about, among other things, P2P connection success.
Here, we train models of P2P connection success using machine learning based
on several features that are observable by the devices.
We argue that connection success is a non-trivial function of many such
features.
Besides this, the predictive models are also rather
dynamic and a good model can perform rather badly if it is based on data
that is more than a year old.
The degree distribution of the P2P network based on this model has
an interesting structure.
We can identify two modes that roughly correspond to "very closed", and "average" nodes,
and a rather long tail that contains relatively open nodes.
Our model allows us to perform realistic simulations of very large overlay networks, when combined
with device measurement traces.
This enables us to have a more informed design of decentralized applications.</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>15:30 - 15:45 </b> -
<b>Decentralized machine learning using compressed push-pull averaging</b>
<div class="title">
<p class="author">
Gábor Danner <a class="aff">(University of Szeged)</a>,
István Hegedűs <a class="aff">(University of Szeged)</a>,
Márk Jelasity <a class="aff">(University of Szeged)</a>
</p>
<details>
<summary>Abstract</summary>
<p>For decentralized learning algorithms communication efficiency is a central issue.
On the one hand, good machine learning models require more and more parameters.
On the other hand, there is a relatively large cost for transferring data via
P2P channels due to bandwidth and unreliability issues.
Here, we propose a novel compression mechanism for P2P machine learning
that is based on the application of stateful codecs
over P2P links.
In addition, we also rely on transfer learning for extra compression.
This means that we train a relatively small model on top of a
high quality pre-trained feature set that is fixed.
We demonstrate these contributions through an experimental analysis over
a real smartphone trace.</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>15:45 - 16:15 </b> -
<b>Session Discussion </b> <br/>
</li>
<li>
<b>16:15 - 16:40 </b> -
<b>Tea Break </b> <br/>
</li>
</ul>
<h5 class="sessionhead">Session 3 <a>(Cooperation)</a></h5>
<ul class="paperlist">
<li class="chair">Session chair: Mark Jelasity</li>
<li>
<b>16:40 - 16:55 </b> -
<b>Gossiping with Append-Only Logs in Secure-Scuttlebutt</b>
<div class="title">
<p class="author">
Anne-Marie Kermarrec <a class="aff">(EPFL)</a>,
Erick Lavoie <a class="aff">(EPFL)</a>,
Christian Tschudin <a class="aff">(University of Basel)</a>
</p>
<details>
<summary>Abstract</summary>
<p>
Middlewares for building social applications, in which infrastructure is provided by participants, are currently developed by open-source communities. Among those, Secure-Scuttlebutt has pioneered the use of replicated *authenticated single-writer append-only logs*, i.e., chains of ordered immutable events specific to each participant, replicated by gossip algorithms that are driven by social signals, to build eventually-consistent social applications. The use of persistent append-only logs removes parameters traditionally required to be tuned for gossiping. We present two gossip models that can be used for replication: a new *open* model, simpler than the current SSB implementation, that works best in small and trusted groups; and the *transitive-interest* model practically deployed by SSB, that scales to thousands of participants and is spam- and sybil-resistant. We also present limitations of both to motivate further research.</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>16:55 - 17:10 </b> -
<b>Foundations of Peer-to-Peer Reputation</b>
<div class="title">
<p class="author">
Quinten Stokkink <a class="aff">(TU Delft)</a>,
Alexander Stannat <a class="aff">(TU Delft)</a>,
Johan Pouwelse <a class="aff">(TU Delft)</a>
</p>
<details>
<summary>Abstract</summary>
<p>
Successful classification of good or bad behavior in the digital domain is limited to central governance, as can be seen with trading platforms, search engines and news feeds.
We explore and consolidate existing work on decentralized reputation systems to form a common denominator for what makes a reputation system successful when applied without a centralized reputation authority, formalized in 7 axioms and 3 postulates.
Reputation must start from nothing and always reward performed work, respectively lowering and increasing as work is consumed and performed.
However, it is impossible for nodes to perform work in a purely synchronous attack-proof work model and real systems must necessarily employ relaxations to such a work model.
We show how the relaxations of performing parallel work, allowing unconsumed work and seeding well-known identities with work satisfy our model.
Our formalizations allow constraint driven design of decentralized reputation mechanisms.</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>17:10 - 17:30 </b> -
<b>Session Discussion </b> <br/>
</li>
<li>
<b>17:30 - 17:40 </b> -
<b>Coffee Break </b> <br/>
</li>
</ul>
<h5 class="sessionhead">Closing</a></h5>
<ul class="paperlist">
<li>
<b>17:40 - 17:55 </b> -
<b>Towards the Science of Essential Decentralised Infrastructures</b> <br/>
<div class="title">
<p class="author"> Johan Pouwelse
<a class="aff">(TU Delft)</a>
</p>
<details>
<summary>Abstract</summary>
<p>Dependence of our society on digital infrastructures is growing daily, confronting us with an urgent task of building ethical and democratic alternatives to monopolistic big-tech platforms. We call upon the scientific community to put our talents to this challenge by creating decentralised infrastructures for trust-based economic and social cooperation.</p>
<p>We empirically demonstrate that a public infrastructure to establish trust between peers in decentralized networks is possible at significant scale.
Our work is based on over 15 years of improving our distributed systems which were used by more than a million people.</p>
<p>We present six stringent criteria for designing trustworthy infrastructure, called <em>zero-server architecture</em>. Adhering to these principles, we designed a novel trustworthy networking infrastructure, called P2P-Apps. It enables smartphone apps to communicate without <em>zero-server architecture</em> servers, by forming a scalable overlay that uses our generic mechanism to build trust between peers, Trustchain. P2P-Apps are generic and can be expanded to serve as an alternative to centralized infrastructure owned by Big Tech.</p>
</details>
<!-- <details> -->
<!-- <summary>Video</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
<!-- <details> -->
<!-- <summary>Pre-print</summary> -->
<!-- <p> -->
<!-- </p> -->
<!-- </details> -->
</div>
</li>
<li>
<b>17:55 - 18:15 </b> -
<b>Q/A, Closing Remarks</b>
</li>
</ul>
<div class="title-box-2"></div>
<div id="attendance" class="title-box-2">
<h5 class="title-left">
Attendance
</h5>
</div>
<p class="lead">
Due to the recent developments around COVID-19, DICG 2020 will be held as a virtual event. The workshop is <b>free and public</b>. However, you need to register (free of charge) to Middleware conference using <a href="https://2020.middleware-conference.org/signup.html"><b>this link</b></a>.
</p>
<span id="clocktext" style="font-kerning:none"></span>
<script>
"use strict";
var textElem = document.getElementById("clocktext");
var targetWidth = 0.4; // Proportion of full screen width
var curFontSize = 20; // Do not change
function updateClock() {
var d = new Date();
var s = "";
s += ((d.getHours() + 11) % 12 + 1) + ":";
s += (10 > d.getMinutes() ? "0" : "") + d.getMinutes() + ":";
s += (10 > d.getSeconds() ? "0" : "") + d.getSeconds() + "\u00A0";
s += d.getHours() >= 12 ? "pm" : "am";
textElem.textContent = s;
setTimeout(updateClock, 1000 - d.getTime() % 1000 + 20);
}
function updateTextSize() {
for (var i = 0; 3 > i; i++) { // Iterate for better better convergence
curFontSize *= targetWidth / (textElem.offsetWidth / textElem.parentNode.offsetWidth);
textElem.style.fontSize = curFontSize + "pt";
}
}
updateClock();
updateTextSize();
window.addEventListener("resize", updateTextSize);
</script>
<div class="title-box-2"></div>
<div id="organization" class="title-box-2">
<h5 class="title-left">
Organization
</h5>
</div>
<p class="lead">
<b>General Co-chairs:</b>
</p>
<ul>
<li><b><a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/distributed-systems/people/johan-pouwelse/">Johan Pouwelse</a></b>
(TU Delft, The Netherlands) </li>
<li><b><a href="http://cricca.disi.unitn.it/montresor/">Alberto Montresor</a></b> (University of Trento, Italy) </li>
</ul>
<p id="local" class="lead">
<b>Local Chairs:</b>
</p>
<ul>
<li><b>Can Umut Ileri</b> (TU Delft, The Netherlands)</li>
<li><b>Georgy Ishmaev</b> (TU Delft, The Netherlands)</li>
</ul>
<p class="lead">
<b>Program Committee:</b>
</p>
<ul>
<li><b>Ozalp Babaoglu</b> (University of Bologna, Italy) </li>
<li><b>Anwitaman Datta</b> (Nanyang TU, Singapore)</li>
<li><b>Kapal Dev</b> (Trinity College Dublin, Ireland)</li>
<li><b>Nigel Gilbert</b> (University of Surrey, UK)</li>
<li><b>Davide Grossi</b> (University of Groningen, The Netherlands)</li>
<li><b>Seif Haridi</b> (KTH Royal Institute of Technology, Sweden)</li>
<li><b>Márk Jelasity</b> (University of Szeged, Hungary) </li>
<li><b>Anne-Marie Kermarrec</b> (EPFL, Switzerland) </li>
<li><b>Martin Kleppmann</b> (University of Cambridge, UK) </li>
<!-- <li><b>Róbert Ormándi</b> (Google Brain, USA) </li> -->
<li><b>Oznur Ozkasap</b> (Koc University, Turkey) </li>
<li><b>Erik Poll</b> (Radboud University, The Netherlands) </li>
</ul>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</section>
<a href="#" class="back-to-top"><i class="fa fa-chevron-up"></i></a>
<div id="preloader"></div>
<!-- JavaScript Libraries -->
<script src="lib/jquery/jquery.min.js"></script>
<script src="lib/jquery/jquery-migrate.min.js"></script>
<script src="lib/popper/popper.min.js"></script>
<script src="lib/bootstrap/js/bootstrap.min.js"></script>
<script src="lib/easing/easing.min.js"></script>
<script src="lib/counterup/jquery.waypoints.min.js"></script>
<script src="lib/counterup/jquery.counterup.js"></script>
<script src="lib/owlcarousel/owl.carousel.min.js"></script>
<script src="lib/lightbox/js/lightbox.min.js"></script>
<script src="lib/typed/typed.min.js"></script>
<!-- Contact Form JavaScript File -->
<script src="contactform/contactform.js"></script>
<!-- Template Main Javascript File -->
<script src="js/main.js"></script>
</body>
</html>