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
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
|
<pre>Internet Engineering Task Force (IETF) A. Knauf
Request for Comments: 8076 T. Schmidt, Ed.
Category: Standards Track HAW Hamburg
ISSN: 2070-1721 G. Hege
daviko GmbH
M. Waehlisch
link-lab & FU Berlin
March 2017
<span class="h1">A Usage for Shared Resources in RELOAD (ShaRe)</span>
Abstract
This document defines a REsource LOcation And Discovery (RELOAD)
Usage for managing shared write access to RELOAD Resources. Shared
Resources in RELOAD (ShaRe) form a basic primitive for enabling
various coordination and notification schemes among distributed
peers. Access in ShaRe is controlled by a hierarchical trust
delegation scheme maintained within an access list. A new
USER-CHAIN-ACL access policy allows authorized peers to write a
Shared Resource without owning its corresponding certificate. This
specification also adds mechanisms to store Resources with a variable
name that is useful whenever peer-independent rendezvous processes
are required.
Status of This Memo
This is an Internet Standards Track document.
This document is a product of the Internet Engineering Task Force
(IETF). It represents the consensus of the IETF community. It has
received public review and has been approved for publication by the
Internet Engineering Steering Group (IESG). Further information on
Internet Standards is available in <a href="./rfc7841#section-2">Section 2 of RFC 7841</a>.
Information about the current status of this document, any errata,
and how to provide feedback on it may be obtained at
<a href="http://www.rfc-editor.org/info/rfc8076">http://www.rfc-editor.org/info/rfc8076</a>.
<span class="grey">Knauf, et al. Standards Track [Page 1]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and the IETF Trust's Legal
Provisions Relating to IETF Documents
(<a href="http://trustee.ietf.org/license-info">http://trustee.ietf.org/license-info</a>) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
<span class="grey">Knauf, et al. Standards Track [Page 2]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
Table of Contents
<a href="#section-1">1</a>. Introduction . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-4">4</a>
<a href="#section-2">2</a>. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-5">5</a>
<a href="#section-3">3</a>. Shared Resources in RELOAD . . . . . . . . . . . . . . . . . <a href="#page-5">5</a>
<a href="#section-3.1">3.1</a>. Mechanisms for Isolating Stored Data . . . . . . . . . . <a href="#page-6">6</a>
<a href="#section-4">4</a>. Access Control List Definition . . . . . . . . . . . . . . . <a href="#page-7">7</a>
<a href="#section-4.1">4.1</a>. Overview . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-7">7</a>
<a href="#section-4.2">4.2</a>. Data Structure . . . . . . . . . . . . . . . . . . . . . <a href="#page-9">9</a>
<a href="#section-5">5</a>. Extension for Variable Resource Names . . . . . . . . . . . . <a href="#page-10">10</a>
<a href="#section-5.1">5.1</a>. Overview . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-10">10</a>
<a href="#section-5.2">5.2</a>. Data Structure . . . . . . . . . . . . . . . . . . . . . <a href="#page-11">11</a>
<a href="#section-5.3">5.3</a>. Overlay Configuration Document Extension . . . . . . . . <a href="#page-12">12</a>
<a href="#section-6">6</a>. Access Control to Shared Resources . . . . . . . . . . . . . <a href="#page-13">13</a>
<a href="#section-6.1">6.1</a>. Granting Write Access . . . . . . . . . . . . . . . . . . <a href="#page-13">13</a>
<a href="#section-6.2">6.2</a>. Revoking Write Access . . . . . . . . . . . . . . . . . . <a href="#page-14">14</a>
<a href="#section-6.3">6.3</a>. Validating Write Access through an ACL . . . . . . . . . <a href="#page-14">14</a>
<a href="#section-6.4">6.4</a>. Operations of Storing Peers . . . . . . . . . . . . . . . <a href="#page-15">15</a>
<a href="#section-6.5">6.5</a>. Operations of Accessing Peers . . . . . . . . . . . . . . <a href="#page-16">16</a>
<a href="#section-6.6">6.6</a>. USER-CHAIN-ACL Access Policy . . . . . . . . . . . . . . <a href="#page-16">16</a>
<a href="#section-7">7</a>. ACCESS-CONTROL-LIST Kind Definition . . . . . . . . . . . . . <a href="#page-17">17</a>
<a href="#section-8">8</a>. Security Considerations . . . . . . . . . . . . . . . . . . . <a href="#page-17">17</a>
<a href="#section-8.1">8.1</a>. Resource Exhaustion . . . . . . . . . . . . . . . . . . . <a href="#page-17">17</a>
<a href="#section-8.2">8.2</a>. Malicious or Misbehaving Storing Peer . . . . . . . . . . <a href="#page-18">18</a>
<a href="#section-8.3">8.3</a>. Trust Delegation to a Malicious or Misbehaving Peer . . . <a href="#page-18">18</a>
<a href="#section-8.4">8.4</a>. Privacy Issues . . . . . . . . . . . . . . . . . . . . . <a href="#page-18">18</a>
<a href="#section-9">9</a>. IANA Considerations . . . . . . . . . . . . . . . . . . . . . <a href="#page-19">19</a>
<a href="#section-9.1">9.1</a>. Access Control Policy . . . . . . . . . . . . . . . . . . <a href="#page-19">19</a>
<a href="#section-9.2">9.2</a>. Data Kind-ID . . . . . . . . . . . . . . . . . . . . . . <a href="#page-19">19</a>
<a href="#section-9.3">9.3</a>. XML Namespace Registration . . . . . . . . . . . . . . . <a href="#page-19">19</a>
<a href="#section-10">10</a>. References . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a>
<a href="#section-10.1">10.1</a>. Normative References . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a>
<a href="#section-10.2">10.2</a>. Informative References . . . . . . . . . . . . . . . . . <a href="#page-20">20</a>
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-21">21</a>
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-22">22</a>
<span class="grey">Knauf, et al. Standards Track [Page 3]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
[<a id="ref-RFC6940">RFC6940</a>] defines the base protocol for REsource LOcation And
Discovery (RELOAD), which allows for application-specific extensions
by Usages. The present document defines such a RELOAD Usage for
managing shared write access to RELOAD Resources and a mechanism to
store Resources with variable names. The Usage for Shared Resources
in RELOAD (ShaRe) enables overlay users to share their exclusive
write access to specific Resource/Kind pairs with others. Shared
Resources form a basic primitive for enabling various coordination
and notification schemes among distributed peers. Write permission
is controlled by an Access Control List (ACL) Kind that maintains a
chain of Authorized Peers for a particular Shared Resource. A newly
defined USER-CHAIN-ACL access control policy enables shared write
access in RELOAD.
The Usage for Shared Resources in RELOAD is designed for jointly
coordinated group applications among distributed peers (e.g., third-
party registration, see [<a href="./rfc7904" title=""A SIP Usage for REsource LOcation And Discovery (RELOAD)"">RFC7904</a>], or distributed conferencing). Of
particular interest are rendezvous processes, where a single
identifier is linked to multiple, dynamic instances of a distributed
cooperative service. Shared write access is based on a trust
delegation mechanism that transfers the authorization to write a
specific Kind data by storing logical Access Control Lists. An ACL
contains the ID of the Kind to be shared and contains trust
delegations from one authorized to another (previously unauthorized)
user.
Shared write access augments the RELOAD security model, which is
based on the restriction that peers are only allowed to write
resources at a small set of well-defined locations (Resource-IDs) in
the overlay. Using the standard access control rules in RELOAD,
these locations are bound to the username or Node-ID in the peer's
certificate. This document extends the base policies to enable a
controlled write access for multiple users to a common Resource-ID.
Additionally, this specification defines an optional mechanism to
store Resources with a variable Resource Name. It enables the
storage of Resources whose name complies to a specific pattern.
Definition of the pattern is arbitrary, but it must contain the
username of the Resource creator.
<span class="grey">Knauf, et al. Standards Track [Page 4]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Terminology</span>
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [<a href="./rfc2119" title=""Key words for use in RFCs to Indicate Requirement Levels"">RFC2119</a>].
This document uses the terminology and definitions from the RELOAD
base [<a href="./rfc6940" title=""REsource LOcation And Discovery (RELOAD) Base Protocol"">RFC6940</a>] and [<a href="./rfc7890" title=""Concepts and Terminology for Peer-to-Peer SIP (P2PSIP)"">RFC7890</a>], in particular the RELOAD Usage,
Resource, and Kind. Additionally, the following terms are used:
Shared Resource: The term "Shared Resource" in this document defines
a RELOAD Resource with its associated Kinds that can be written or
overwritten by multiple RELOAD users following the specifications
in this document.
Access Control List: The term "Access Control List" in this document
defines a logical list of RELOAD users allowed to write a specific
RELOAD Resource/Kind pair by following the specifications in this
document. The list items are stored as Access Control List Kinds
that map trust delegations from user A to user B, where A is
allowed to write a Shared Resource and the Access Control List,
while B is a user that obtains write access to specified Kinds
from A.
Resource Owner: The term "Resource Owner" in this document defines a
RELOAD peer that initially stored a Resource to be shared. The
Resource Owner possesses the RELOAD certificate that grants write
access to a specific Resource/Kind pair using the RELOAD
certificate-based access control policies.
Authorized Peer: The term "Authorized Peer" in this document defines
a RELOAD peer that was granted write access to a Shared Resource
by permission of the Resource Owner or another Authorized Peer.
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Shared Resources in RELOAD</span>
A RELOAD user that owns a certificate for writing at a specific
overlay location can maintain one or more RELOAD Kinds that are
designated for a non-exclusive write access shared with other RELOAD
users. The mechanism to share those Resource/Kind pairs with a group
of users consists of two basic steps:
1. Storage of the Resource/Kind pairs to be shared.
2. Storage of an Access Control List (ACL) associated with those
Kinds.
<span class="grey">Knauf, et al. Standards Track [Page 5]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
ACLs are created by the Resource Owner and contain ACL items, each
delegating the permission of writing the shared Kind to a specific
user called the "Authorized Peer". For each shared Kind data, its
Resource owner stores a root item that initiates an Access Control
List. Trust delegation to the Authorized Peer can include the right
to further delegate the write permission, enabling a tree of trust
delegations with the Resource Owner as trust anchor at its root.
The Resource/Kind pair to be shared can be any RELOAD Kind that
complies to the following specifications:
Isolated Data Storage: To prevent concurrent writing from race
conditions, each data item stored within a Shared Resource SHALL
be exclusively maintained by the RELOAD user who created it.
Hence, Usages that allow the storage of Shared Resources are
REQUIRED to use either the array or dictionary data model and
apply additional mechanisms for isolating data as described in
<a href="#section-3.1">Section 3.1</a>.
Access Control Policy: To ensure write access to Shared Resource by
Authorized Peers, each Usage MUST use the USER-CHAIN-ACL access
policy as described in <a href="#section-6.6">Section 6.6</a>.
Resource Name Extension: To enable Shared Resources to be stored
using a variable resource name, this document defines an optional
ResourceNameExtension structure. It contains the Resource Name of
the Kind data to be stored and allows any receiver of a shared
data to validate whether the Resource Name hashes to the Resource-
ID. The ResourceNameExtension is made optional by configuration.
The ResourceNameExtension field is only present in the Kind data
structure when configured in the corresponding kind-block of the
overlay configuration document (for more details, see
<a href="#section-5.3">Section 5.3</a>). If the configuration allows variable resource
names, a Kind using the USER-CHAIN-ACL policy MUST use the
ResourceNameExtension as the initial field within the Kind data
structure definition. Otherwise, the Kind data structure does not
contain the ResourceNameExtension structure.
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Mechanisms for Isolating Stored Data</span>
This section defines mechanisms to avoid race conditions while
concurrently writing an array or dictionary of a Shared Resource.
If a dictionary is used in the Shared Resource, the dictionary key
MUST be the Node-ID of the certificate that will be used to sign the
stored data. Thus, data access is bound to the unique ID holder, and
write concurrency does not occur.
<span class="grey">Knauf, et al. Standards Track [Page 6]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
If the data model of the Shared Resource is an array, each Authorized
Peer that chooses to write data SHALL obtain its exclusive range of
the array indices. The following algorithm will generate an array
indexing scheme that avoids collisions:
1. Obtain the Node-ID of the certificate that will be used to sign
the stored data.
2. Take the least significant 24 bits of that Node-ID to prefix the
array index.
3. Append an 8-bit individual index value to those 24 bits of the
Node-ID.
The resulting 32-bit long integer MUST be used as the index for
storing an array entry in a Shared Resource. The 24 bits of the
Node-ID serve as a collision-resistant identifier. The 8-bit
individual index remains under the control of a single Peer and can
be incremented individually for further array entries. In total,
each Peer can generate 256 distinct entries for application-specific
use.
The mechanism to create the array index inherits collision-resistance
from the overlay hash function in use (e.g., SHA-1). It is designed
to work reliably for small sizes of groups as applicable to resource
sharing. In the rare event of a collision, the Storing Peer will
refuse to (over-)write the requested array index and protect indexing
integrity as defined in <a href="#section-6.1">Section 6.1</a>. A Peer could rejoin the overlay
with a different Node-ID in such a case.
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Access Control List Definition</span>
<span class="h3"><a class="selflink" id="section-4.1" href="#section-4.1">4.1</a>. Overview</span>
An Access Control List (ACL) is a (self-managed) Shared Resource that
contains a list of AccessControlListItem structures as defined in
<a href="#section-4.2">Section 4.2</a>. Each entry delegates write access for a specific Kind
data to a single RELOAD user. An ACL enables the RELOAD user who is
authorized to write a specific Resource-ID to delegate his exclusive
write access to a specific Kind to further users of the same RELOAD
overlay. Therefore, each Access Control List data structure carries
the information about who obtains write access, the Kind-ID of the
Resource to be shared, and whether delegation includes write access
to the ACL itself. The latter condition grants the right to delegate
write access further for the Authorized Peer. Access Control Lists
are stored at the same overlay location as the Shared Resource and
use the RELOAD array data model. They are initially created by the
Resource Owner.
<span class="grey">Knauf, et al. Standards Track [Page 7]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
Figure 1 shows an example of an Access Control List. We omit the
res_name_ext field to simplify illustration. The array entry at
index 0x123abc01 displays the initial creation of an ACL for a Shared
Resource of Kind-ID 1234 at the same Resource-ID. It represents the
root item of the trust delegation tree for this shared RELOAD Kind.
The root entry MUST contain the username of the Resource owner in the
"to_user" field and can only be written by the owner of the public
key certificate associated with this Resource-ID. The
allow_delegation (ad) flag for a root ACL item is set to 1 by
default. The array index is generated by using the mechanism for
isolating stored data as described in <a href="#section-3.1">Section 3.1</a>. Hence, the most
significant 24 bits of the array index (0x123abc) are the least
significant 24 bits of the Node-ID of the Resource Owner.
The array item at index 0x123abc02 represents the first trust
delegation to an Authorized Peer that is thus permitted to write to
the Shared Resource of Kind-ID 1234. Additionally, the Authorized
peer Alice is also granted write access to the ACL as indicated by
the allow_delegation flag (ad) set to 1. This configuration
authorizes Alice to store further trust delegations to the Shared
Resource, i.e., add items to the ACL. On the contrary, index
0x456def01 illustrates trust delegation for Kind-ID 1234, in which
the Authorized Peer Bob is not allowed to grant access to further
peers (ad = 0). Each Authorized Peer signs its ACL items by using
its own signer identity along with its own private key. This allows
other peers to validate the origin of an ACL item and makes ownership
transparent.
To manage Shared Resource access of multiple Kinds at a single
location, the Resource Owner can create new ACL entries that refer to
another Kind-ID as shown in array entry index 0x123abc03. Note that
overwriting existing items in an Access Control List with a change in
the Kind-ID revokes all trust delegations in the corresponding
subtree (see <a href="#section-6.2">Section 6.2</a>). Authorized Peers are only enabled to
overwrite existing ACL item they own. The Resource Owner is allowed
to overwrite any existing ACL item, but should be aware of its
consequences on the trust delegation chain.
<span class="grey">Knauf, et al. Standards Track [Page 8]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
+------------------------------------------------------+
| Access Control List |
+-----------+------------------------------+-----------+
| #Index | Array Entries | signed by |
+-----------+------------------------------+-----------+
| 123abc01 | to_user:Owner Kind:1234 ad:1 | Owner |
+-----------+------------------------------+-----------+
| 123abc02 | to_user:Alice Kind:1234 ad:1 | Owner |
+-----------+------------------------------+-----------+
| 123abc03 | to_user:Owner Kind:4321 ad:1 | Owner |
+-----------+------------------------------+-----------+
| 123abc04 | to_user:Carol Kind:4321 ad:0 | Owner |
+-----------+------------------------------+-----------+
| ... | ... | ... |
+-----------+------------------------------+-----------+
| 456def01 | to_user:Bob Kind:1234 ad:0 | Alice |
+-----------+------------------------------+-----------+
| ... | ... | ... |
+-----------+------------------------------+-----------+
Figure 1: Simplified Example of an Access Control List, Including
Entries for Two Different Kind-IDs and Varying Delegation (AD)
Configurations
Implementors of ShaRe should be aware that the trust delegation in an
Access Control List need not be loop free. Self-contained circular
trust delegation from A to B and B to A are syntactically possible,
even though not very meaningful.
<span class="h3"><a class="selflink" id="section-4.2" href="#section-4.2">4.2</a>. Data Structure</span>
The Kind data structure for the Access Control List is defined as
follows:
struct {
/* res_name_ext is optional, see documentation */
ResourceNameExtension res_name_ext;
opaque to_user<0..2^16-1>;
KindId kind;
Boolean allow_delegation;
} AccessControlListItem;
<span class="grey">Knauf, et al. Standards Track [Page 9]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
The AccessControlListItem structure is composed of:
res_name_ext: This optional field contains the Resource Name of a
ResourceNameExtension (see <a href="#section-5.2">Section 5.2</a>) to be used by a Shared
Resource with a variable resource name. This name is used by the
storing peer for validating, whether a variable resources name
matches one of the predefined naming pattern from the
configuration document for this Kind. The presence of this field
is bound to a variable resource name element in the corresponding
kind-block of the configuration document whose "enable" attribute
is set to true (see <a href="#section-5.3">Section 5.3</a>). Otherwise, if the "enable"
attribute is false, the res_name_ext field SHALL NOT be present in
the Kind data structure.
to_user: This field contains the username of the RELOAD peer that
obtains write permission to the Shared Resource.
kind: This field contains the Kind-ID of the Shared Resource.
allow_delegation: If true, this Boolean flag indicates that the
Authorized Peer in the 'to_user' field is allowed to add
additional entries to the ACL for the specified Kind-ID.
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Extension for Variable Resource Names</span>
<span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a>. Overview</span>
In certain use cases, such as conferencing, it is desirable to
increase the flexibility of a peer in using Resource Names beyond
those defined by the username or Node-ID fields in its certificate.
For this purpose, this document presents the concept for variable
Resources Names that enables providers of RELOAD instances to define
relaxed naming schemes for overlay Resources.
Each RELOAD node uses a certificate to identify itself using its
username (or Node-ID) while storing data under a specific Resource-ID
(see <a href="./rfc6940#section-7.3">Section 7.3 in [RFC6940]</a>). The specifications in this document
scheme adhere to this paradigm, but enable a RELOAD peer to store
values of Resource Names that are derived from the username in its
certificate. This is done by using a Resource Name with a variable
substring that still matches the username in the certificate using a
pattern defined in the overlay configuration document. Thus, despite
being variable, an allowable Resource Name remains tied to the
Owner's certificate. A sample pattern might be formed as follows:
Example Pattern:
.*-conf-$USER@$DOMAIN
<span class="grey">Knauf, et al. Standards Track [Page 10]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
When defining the pattern, care must be taken to avoid conflicts
arising from two usernames of which one is a substring of the other.
In such cases, the holder of the shorter name could threaten to block
the resources of the longer-named peer by choosing the variable part
of a Resource Name to contain the entire longer username. For
example, a "*$USER" pattern would allow user EVE to define a resource
with name "STEVE" and to block the resource name for user STEVE
through this. This problem can easily be mitigated by delimiting the
variable part of the pattern from the username part by some fixed
string, that by convention is not part of a username (e.g., the
"-conf-" in the above Example).
<span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a>. Data Structure</span>
This section defines the optional ResourceNameExtension structure for
every Kind that uses the USER-CHAIN-ACL access control policy.
enum { pattern(1), (255)} ResourceNameType;
struct {
ResourceNameType type;
uint16 length;
select(type) {
case pattern:
opaque resource_name<0..2^16-1>;
/* Types can be extended */
};
} ResourceNameExtension;
The content of the ResourceNameExtension consists of:
length: This field contains the length of the remaining data
structure. It is only used to allow for further extensions to
this data structure.
The content of the rest of the data structure depends of the
ResourceNameType. Currently, the only defined type is "pattern".
If the type is "pattern", then the following data structure contains
an opaque <0..2^16-1> field containing the Resource Name of the Kind
being stored. The type "pattern" further indicates that the Resource
Name MUST match to one of the variable resource name patterns defined
for this Kind in the configuration document.
The ResourceNameType enum and the ResourceNameExtension structure can
be extended by further Usages to define other naming schemes.
<span class="grey">Knauf, et al. Standards Track [Page 11]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h3"><a class="selflink" id="section-5.3" href="#section-5.3">5.3</a>. Overlay Configuration Document Extension</span>
This section extends the overlay configuration document by defining
new elements for patterns relating resource names to usernames. It
is noteworthy that additional constraints on the syntax and semantic
of names can apply according to specific Usages. For example,
Address of Record (AOR) syntax restrictions apply when using P2PSIP
[<a href="./rfc7904" title=""A SIP Usage for REsource LOcation And Discovery (RELOAD)"">RFC7904</a>], while a more general naming is feasible in plain RELOAD.
The <variable-resource-names> element serves as a container for one
or multiple <pattern> sub-elements. It is an additional parameter
within the kind-block and has a boolean "enable" attribute that
indicates, if true, that the overlay provider allows variable
resource names for this Kind. The default value of the "enable"
attribute is "false". In the absence of a <variable-resource-names>
element for a Kind using the USER-CHAIN-ACL access policy (see
<a href="#section-6.6">Section 6.6</a>), implementors MUST assume this default value.
A <pattern> element MUST be present if the "enabled" attribute of its
parent element is set to true. Each <pattern> element defines a
pattern for constructing extended resource names for a single Kind.
It is of type xsd:string and interpreted as a regular expression
according to "POSIX Extended Regular Expression" (see the
specifications in [<a href="#ref-IEEE-Posix">IEEE-Posix</a>]). In this regular expression, $USER
and $DOMAIN are used as variables for the corresponding parts of the
string in the certificate username field (with $USER preceding and
$DOMAIN succeeding the '@'). Both variables MUST be present in any
given pattern definition. Furthermore, variable parts in <pattern>
elements defined in the overlay configuration document MUST remain
syntactically separated from the username part (e.g., by a dedicated
delimiter) to prevent collisions with other names of other users. If
no pattern is defined for a Kind, if the "enable" attribute is false,
or if the regular expression does not meet the requirements specified
in this section, the allowable Resource Names are restricted to the
username of the signer for Shared Resource.
<span class="grey">Knauf, et al. Standards Track [Page 12]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
The RELAX NG Grammar for the Variable Resource Names Extension reads:
# VARIABLE RESOURCE URN SUB-NAMESPACE
namespace share = "urn:ietf:params:xml:ns:p2p:config-base:share"
# VARIABLE RESOURCE NAMES ELEMENT
kind-parameter &= element share:variable-resource-names {
attribute enable { xsd:boolean },
# PATTERN ELEMENT
element share:pattern { xsd:string }*
}?
Whitespace and case processing follows the rules of [<a href="#ref-OASIS.relax_ng">OASIS.relax_ng</a>]
and XML Schema Datatypes [<a href="#ref-W3C.REC-xmlschema-2-20041028">W3C.REC-xmlschema-2-20041028</a>].
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Access Control to Shared Resources</span>
<span class="h3"><a class="selflink" id="section-6.1" href="#section-6.1">6.1</a>. Granting Write Access</span>
Write access to a Kind that is intended to be shared with other
RELOAD users can be initiated solely by the Resource Owner. A
Resource Owner can share RELOAD Kinds by using the following
procedure:
o The Resource Owner stores an ACL root item at the Resource-ID of
the Shared Resource. The root item contains the
ResourceNameExtension field (see <a href="#section-5.2">Section 5.2</a>), the username of the
Resource Owner and Kind-ID of the Shared Resource. The
allow_delegation flag is set to 1. The index of array data
structure MUST be generated as described in <a href="#section-3.1">Section 3.1</a>.
o Further ACL items for this Kind-ID stored by the Resource Owner
MAY delegate write access to Authorized Peers. These ACL items
contain the same resource name extension field, the username of
the Authorized Peer, and the Kind-ID of the Shared Resource.
Optionally, the Resource Owner sets the "ad" to 1 (the default
equals 0) to enable the Authorized Peer to further delegate write
access. For each succeeding ACL item, the Resource Owner
increments its individual index value by one (see <a href="#section-3.1">Section 3.1</a>) so
that items can be stored in the numerical order of the array index
starting with the index of the root item.
<span class="grey">Knauf, et al. Standards Track [Page 13]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
An Authorized Peer with delegation allowance ("ad"=1) can extend the
access to an existing Shared Resource as follows:
o An Authorized Peer can store additional ACL items at the Resource-
ID of the Shared Resource. These ACL items contain the resource
name extension field, the username of the newly Authorized Peer,
and the Kind-ID of the Shared Resource. Optionally, the "ad" flag
is set to 1 for allowing the newly Authorized Peer to further
delegate write access. The array index MUST be generated as
described in <a href="#section-3.1">Section 3.1</a>. Each succeeding ACL item can be stored
in the numerical order of the array index.
A store request by an Authorized Peer that attempts to overwrite any
ACL item signed by another Peer is unauthorized and causes an
Error_Forbidden response from the Storing Peer. Such access
conflicts could be caused by an array index collision. However, the
probability of a collision of two or more identical array indices
will be negligibly low using the mechanism for isolating stored data
(see <a href="#section-3.1">Section 3.1</a>).
<span class="h3"><a class="selflink" id="section-6.2" href="#section-6.2">6.2</a>. Revoking Write Access</span>
Write permissions are revoked by storing a nonexistent value (see
<a href="./rfc6940#section-7.2.1">[RFC6940], Section 7.2.1</a>) at the corresponding item of the Access
Control List. Revoking a permission automatically invalidates all
delegations performed by that user including all subsequent
delegations. This allows the invalidation of entire subtrees of the
delegations tree with only a single operation. Overwriting the root
item with a nonexistent value of an Access List invalidates the
entire delegations tree.
An existing ACL item MUST only be overwritten by the user who
initially stored the corresponding entry, or by the Resource Owner
that is allowed to overwrite all ACL items for revoking write access.
To protect the privacy of the users, the Resource Owner SHOULD
overwrite all subtrees that have been invalidated.
<span class="h3"><a class="selflink" id="section-6.3" href="#section-6.3">6.3</a>. Validating Write Access through an ACL</span>
Access Control Lists are used to transparently validate authorization
of peers for writing a data value at a Shared Resource. Thereby, it
is assumed that the validating peer is in possession of the complete
and most recent ACL for a specific Resource/Kind pair. The
corresponding procedure consists of recursively traversing the trust
delegation tree with strings compared as binary objects. It proceeds
as follows:
<span class="grey">Knauf, et al. Standards Track [Page 14]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
1. Obtain the username of the certificate used for signing the data
stored at the Shared Resource. This is the user who requested
the write operation.
2. Validate that an item of the corresponding ACL (i.e., for this
Resource/Kind pair) contains a "to_user" field whose value equals
the username obtained in step 1. If the Shared Resource under
examination is an Access Control List Kind, further validate if
the "ad" flag is set to 1.
3. Select the username of the certificate that was used to sign the
ACL item obtained in the previous step.
4. Validate that an item of the corresponding ACL contains a
"to_user" field whose value equals the username obtained in step
3. Additionally, validate that the "ad" flag is set to 1.
5. Repeat steps 3 and 4 until the "to_user" value is equal to the
username of the signer of the ACL in the selected item. This
final ACL item is expected to be the root item of this ACL, which
MUST be further validated by verifying that the root item was
signed by the owner of the ACL Resource.
The trust delegation chain is valid if and only if all verification
steps succeed. In this case, the creator of the data value of the
Shared Resource is an Authorized Peer.
Note that the ACL validation procedure can be omitted whenever the
creator of data at a Shared Resource is the Resource Owner itself.
The latter can be verified by its public key certificate as defined
in <a href="#section-6.6">Section 6.6</a>.
<span class="h3"><a class="selflink" id="section-6.4" href="#section-6.4">6.4</a>. Operations of Storing Peers</span>
Storing peers, at which Shared Resource and ACL are physically
stored, are responsible for controlling storage attempts to a Shared
Resource and its corresponding Access Control List. To assert the
USER-CHAIN-ACL access policy (see <a href="#section-6.6">Section 6.6</a>), a storing peer MUST
perform the access validation procedure described in <a href="#section-6.3">Section 6.3</a> on
any incoming store request using the most recent Access Control List
for every Kind that uses the USER-CHAIN-ACL policy. It SHALL further
ensure that only the Resource Owner stores new ACL root items for
Shared Resources.
<span class="grey">Knauf, et al. Standards Track [Page 15]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h3"><a class="selflink" id="section-6.5" href="#section-6.5">6.5</a>. Operations of Accessing Peers</span>
Accessing peers, i.e., peers that fetch a Shared Resource, can
validate that the originator of a Shared Resource was authorized to
store data at this Resource-ID by processing the corresponding ACL.
To enable an accessing peer to perform the access validation
procedure described in <a href="#section-6.3">Section 6.3</a>, it first needs to obtain the most
recent Access Control List in the following way:
1. Send a Stat request to the Resource-ID of the Shared Resource to
obtain all array indexes of stored ACL Kinds (as per <a href="./rfc6940#section-7.4.3">[RFC6940],
Section 7.4.3</a>.).
2. Fetch all indexes of existing ACL items at this Resource-ID by
using the array ranges retrieved in the Stat request answer.
Peers can cache previously fetched Access Control Lists up to the
maximum lifetime of an individual item. Since stored values could
have been modified or invalidated prior to their expiration, an
accessing peer SHOULD use a Stat request to check for updates prior
to using the data cache.
<span class="h3"><a class="selflink" id="section-6.6" href="#section-6.6">6.6</a>. USER-CHAIN-ACL Access Policy</span>
This document specifies an additional access control policy to the
RELOAD base document [<a href="./rfc6940" title=""REsource LOcation And Discovery (RELOAD) Base Protocol"">RFC6940</a>]. The USER-CHAIN-ACL policy allows
Authorized Peers to write a Shared Resource, even though they do not
own the corresponding certificate. Additionally, the USER-CHAIN-ACL
allows the storage of Kinds with a variable resource name that are
following one of the specified naming patterns. Hence, on an inbound
store request on a Kind that uses the USER-CHAIN-ACL access policy,
the following rules MUST be applied:
In the USER-CHAIN-ACL policy, a given value MUST NOT be written or
overwritten, if neither one of USER-MATCH or USER-NODE-MATCH
(mandatory if the data model is dictionary) access policies of the
base document [<a href="./rfc6940" title=""REsource LOcation And Discovery (RELOAD) Base Protocol"">RFC6940</a>] applies.
Additionally, the store request MUST be denied if the signer's
certificate does not contain a username that matches to the user and
domain portion in one of the variable resource name patterns (cf.
<a href="#section-5">Section 5</a>) specified in the configuration document or if the hashed
Resource Name does not match the Resource-ID. The Resource Name of
the Kind to be stored MUST be taken from the mandatory
ResourceNameExtension field in the corresponding Kind data structure.
<span class="grey">Knauf, et al. Standards Track [Page 16]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
If the access rights cannot be verified according to the ACL
validation procedure described in <a href="#section-6.3">Section 6.3</a>, the store request MUST
also be denied.
Otherwise, the store request can be processed further.
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. ACCESS-CONTROL-LIST Kind Definition</span>
This section defines the ACCESS-CONTROL-LIST Kind previously
described in this document.
Name: ACCESS-CONTROL-LIST
Kind IDs: The Resource Name for ACCESS-CONTROL-LIST Kind-ID is the
Resource Name of the Kind that will be shared by using the ACCESS-
CONTROL-LIST Kind.
Data Model: The data model for the ACCESS-CONTROL-LIST Kind-ID is
array. The array indexes are formed by using the mechanism for
isolated stored data as described in <a href="#section-3.1">Section 3.1</a>.
Access Control: USER-CHAIN-ACL (see <a href="#section-6.6">Section 6.6</a>).
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Security Considerations</span>
In this section, we discuss security issues that are relevant to the
usage of Shared Resources in RELOAD [<a href="./rfc6940" title=""REsource LOcation And Discovery (RELOAD) Base Protocol"">RFC6940</a>].
<span class="h3"><a class="selflink" id="section-8.1" href="#section-8.1">8.1</a>. Resource Exhaustion</span>
Joining a RELOAD overlay inherently poses a certain resource load on
a peer, because it has to store and forward data for other peers. In
common RELOAD semantics, each Resource-ID and thus position in the
overlay, may only be written by a limited set of peers -- often even
only a single peer, which limits this burden. In the case of Shared
Resources, a single resource may be written by multiple peers who may
even write an arbitrary number of entries (e.g., delegations in the
ACL). This leads to an enhanced use of resources at individual
overlay nodes. The problem of resource exhaustion can easily be
mitigated for Usages based on the ShaRe-Usage by imposing
restrictions on size, i.e., <max-size> element for a certain Kind in
the configuration document.
<span class="grey">Knauf, et al. Standards Track [Page 17]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h3"><a class="selflink" id="section-8.2" href="#section-8.2">8.2</a>. Malicious or Misbehaving Storing Peer</span>
The RELOAD overlay is designed to operate despite the presence of a
small set of misbehaving peers. This is not different for Shared
Resources since a small set of malicious peers does not disrupt the
functionality of the overlay in general, but may have implications
for the peers needing to store or access information at the specific
locations in the ID space controlled by a malicious peer. A storing
peer could withhold stored data, which results in a denial of service
to the group using the specific resource. But it could not return
forged data, since the validity of any stored data can be
independently verified using the attached signatures.
<span class="h3"><a class="selflink" id="section-8.3" href="#section-8.3">8.3</a>. Trust Delegation to a Malicious or Misbehaving Peer</span>
A Resource Owner that erroneously delegated write access to a Shared
Resource for a misbehaving peer enables this malicious member of the
overlay to interfere with the corresponding group application in
several unwanted ways. Examples of destructive interferences range
from exhausting shared storage to dedicated application-specific
misuse. Additionally, a bogus peer that was granted delegation
rights may authorize further malicious collaborators to writing the
Shared Resource.
It is the obligation of the Resource Owner to bind trust delegation
to apparent trustworthiness. Additional measures to monitor proper
behavior may be applied. In any case, the Resource Owner will be
able to revoke the trust delegation of an entire tree in a single
overwrite operation. It further holds the right to overwrite any
malicious contributions to the shared resource under misuse.
<span class="h3"><a class="selflink" id="section-8.4" href="#section-8.4">8.4</a>. Privacy Issues</span>
All data stored in the Shared Resource is readable by any node in the
overlay; thus, applications requiring privacy need to encrypt the
data. The ACL needs to be stored unencrypted; thus, the list members
of a group using a Shared Resource will always be publicly visible.
<span class="grey">Knauf, et al. Standards Track [Page 18]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. IANA Considerations</span>
<span class="h3"><a class="selflink" id="section-9.1" href="#section-9.1">9.1</a>. Access Control Policy</span>
IANA has registered the following entry in the "RELOAD Access Control
Policies" registry (cf. [<a href="./rfc6940" title=""REsource LOcation And Discovery (RELOAD) Base Protocol"">RFC6940</a>]) to represent the USER-CHAIN-ACL
Access Control Policy, as described in <a href="#section-6.6">Section 6.6</a>.
+-------------------+----------+
| Access Policy | RFC |
+-------------------+----------+
| USER-CHAIN-ACL | <a href="./rfc8076">RFC 8076</a> |
+-------------------+----------+
<span class="h3"><a class="selflink" id="section-9.2" href="#section-9.2">9.2</a>. Data Kind-ID</span>
IANA has registered the following code point in the "RELOAD Data
Kind-ID" registry (cf. [<a href="./rfc6940" title=""REsource LOcation And Discovery (RELOAD) Base Protocol"">RFC6940</a>]) to represent the ShaRe ACCESS-
CONTROL-LIST kind, as described in <a href="#section-7">Section 7</a>.
+----------------------+------------+----------+
| Kind | Kind-ID | RFC |
+----------------------+------------+----------+
| ACCESS-CONTROL-LIST | 0x4 | <a href="./rfc8076">RFC 8076</a> |
+----------------------+------------+----------+
<span class="h3"><a class="selflink" id="section-9.3" href="#section-9.3">9.3</a>. XML Namespace Registration</span>
This document registers the following URI for the config XML
namespace in the IETF XML registry defined in [<a href="./rfc3688" title=""The IETF XML Registry"">RFC3688</a>].
URI: urn:ietf:params:xml:ns:p2p:config-base:share
Registrant Contact: The IESG
XML: N/A, the requested URI is an XML namespace
<span class="grey">Knauf, et al. Standards Track [Page 19]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
<span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. References</span>
<span class="h3"><a class="selflink" id="section-10.1" href="#section-10.1">10.1</a>. Normative References</span>
[<a id="ref-IEEE-Posix">IEEE-Posix</a>]
"IEEE Standard for Information Technology - Portable
Operating System Interface (POSIX) - Part 2: Shell and
Utilities (Vol. 1)", IEEE Std 1003.2-1992, ISBN
1-55937-255-9, DOI 10.1109/IEEESTD.1993.6880751, January
1993, <<a href="http://ieeexplore.ieee.org/document/6880751/">http://ieeexplore.ieee.org/document/6880751/</a>>.
[<a id="ref-OASIS.relax_ng">OASIS.relax_ng</a>]
Clark, J. and M. Murata, "RELAX NG Specification",
December 2001.
[<a id="ref-RFC2119">RFC2119</a>] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>,
DOI 10.17487/RFC2119, March 1997,
<<a href="http://www.rfc-editor.org/info/rfc2119">http://www.rfc-editor.org/info/rfc2119</a>>.
[<a id="ref-RFC3688">RFC3688</a>] Mealling, M., "The IETF XML Registry", <a href="https://www.rfc-editor.org/bcp/bcp81">BCP 81</a>, <a href="./rfc3688">RFC 3688</a>,
DOI 10.17487/RFC3688, January 2004,
<<a href="http://www.rfc-editor.org/info/rfc3688">http://www.rfc-editor.org/info/rfc3688</a>>.
[<a id="ref-RFC6940">RFC6940</a>] Jennings, C., Lowekamp, B., Ed., Rescorla, E., Baset, S.,
and H. Schulzrinne, "REsource LOcation And Discovery
(RELOAD) Base Protocol", <a href="./rfc6940">RFC 6940</a>, DOI 10.17487/RFC6940,
January 2014, <<a href="http://www.rfc-editor.org/info/rfc6940">http://www.rfc-editor.org/info/rfc6940</a>>.
[<a id="ref-W3C.REC-xmlschema-2-20041028">W3C.REC-xmlschema-2-20041028</a>]
Malhotra, A. and P. Biron, "XML Schema Part 2: Datatypes
Second Edition", World Wide Web Consortium Recommendation
REC-xmlschema-2-20041028, October 2004,
<<a href="http://www.w3.org/TR/2004/REC-xmlschema-2-20041028">http://www.w3.org/TR/2004/REC-xmlschema-2-20041028</a>>.
<span class="h3"><a class="selflink" id="section-10.2" href="#section-10.2">10.2</a>. Informative References</span>
[<a id="ref-RFC7890">RFC7890</a>] Bryan, D., Matthews, P., Shim, E., Willis, D., and S.
Dawkins, "Concepts and Terminology for Peer-to-Peer SIP
(P2PSIP)", <a href="./rfc7890">RFC 7890</a>, DOI 10.17487/RFC7890, June 2016,
<<a href="http://www.rfc-editor.org/info/rfc7890">http://www.rfc-editor.org/info/rfc7890</a>>.
[<a id="ref-RFC7904">RFC7904</a>] Jennings, C., Lowekamp, B., Rescorla, E., Baset, S.,
Schulzrinne, H., and T. Schmidt, Ed., "A SIP Usage for
REsource LOcation And Discovery (RELOAD)", <a href="./rfc7904">RFC 7904</a>,
DOI 10.17487/RFC7904, October 2016,
<<a href="http://www.rfc-editor.org/info/rfc7904">http://www.rfc-editor.org/info/rfc7904</a>>.
<span class="grey">Knauf, et al. Standards Track [Page 20]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
Acknowledgments
This work was stimulated by fruitful discussions in the P2PSIP
working group and the SAM research group. We would like to thank all
active members for their constructive thoughts and feedback. In
particular, the authors would like to thank (in alphabetical order)
Emmanuel Baccelli, Ben Campbell, Alissa Cooper, Lothar Grimm, Russ
Housley, Cullen Jennings, Matt Miller, Peter Musgrave, Joerg Ott,
Marc Petit-Huguenin, Peter Pogrzeba, and Jan Seedorf. This work was
partly funded by the German Federal Ministry of Education and
Research, projects HAMcast, Mindstone, and SAFEST.
<span class="grey">Knauf, et al. Standards Track [Page 21]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span>
<span class="grey"><a href="./rfc8076">RFC 8076</a> ShaRe March 2017</span>
Authors' Addresses
Alexander Knauf
HAW Hamburg
Berliner Tor 7
Hamburg D-20099
Germany
Phone: +4940428758067
Email: alexanderknauf@gmail.com
Thomas C. Schmidt
HAW Hamburg
Berliner Tor 7
Hamburg D-20099
Germany
Email: t.schmidt@haw-hamburg.de
URI: <a href="http://inet.haw-hamburg.de/members/schmidt">http://inet.haw-hamburg.de/members/schmidt</a>
Gabriel Hege
daviko GmbH
Schillerstr. 107
Berlin D-10625
Germany
Phone: +493043004344
Email: hege@daviko.com
Matthias Waehlisch
link-lab & FU Berlin
Hoenower Str. 35
Berlin D-10318
Germany
Email: mw@link-lab.net
URI: <a href="http://www.inf.fu-berlin.de/~waehl">http://www.inf.fu-berlin.de/~waehl</a>
Knauf, et al. Standards Track [Page 22]
</pre>
|
