Protocol Unification Sample Clauses

Protocol Unification. Although described separately in Section IV, the four STR operations (join, leave, merge and partition) actually represent different strands of a single protocol. We justify this claim with an informal argument below. Obviously, join and leave are special cases of merge and partition, respectively. We observed that merge and partition can be collapsed into a single protocol, since, in either case, the key tree changes and the remaining group members lack some number of bkeys that prevents them from computing the new root key. In a partition, the remaining members (in any surviving group fragment) reconstruct the tree where some bkeys are missing. In case of a merge, let us suppose that k groups (Tree T1 through Tk) are merging. After the first round of the merge protocol, all members reconstruct the new tree unambiguously and independently where all bkeys from the sponsor node up to the root node are missing similar to the partition protocol. The sponsor in merge is located at the topmost leaf node of the highest key tree. As discussed in Sections IV-D and IV-C, every member reconstructs the key tree after a partition and a merge in one and two rounds, respectively. From these outlines of the merge and partition protocol, we can find some similarities: • Whenever new membership event happens, all current group members first reconstruct the key tree. • The resulting key tree has missing bkeys from the parent node of the sponsor to the root node as well as the sponsor’s blinded session random. • The sponsor generates new session random and computes all keys and bkeys from its parent node up to the node just below the root node. It then broadcasts the whole key tree containing only bkeys and blinded session randoms. • Using the broadcast message, any member can compute the group key. This apparent similarity between partition and merge allows us to combine the protocols stem- ming from all membership events into a single, unified protocol. Fig. 9 shows the pseudocode. The incentive for this is threefold. First, unification allows us to simplify the implementation and minimize its size. Second, the overall security and correctness are easier to demonstrate with a single protocol. Third, we can now claim that (with a slight modification) the STR protocol is self-stabilizing and fault-tolerant as discussed below. 1 receive msg (msg type = membership event) 2 construct new tree 3 while there are missing bkeys 4 if ((I can compute any missing keys and I am the spo...
Sample 1Sample 2
AutoNDA by SimpleDocs
Protocol Unification. Although described separately in the preceding sections, the four TGDH operations (join, leave, merge and partition) actually represent different strands of a single protocol. We justify this claim with an informal argument below. Obviously, join and leave are special cases of merge and partition, respectively. We observe that merge and partition can be collapsed into a single protocol, since, in either case, the key tree changes and remaining group members lack some number of bkeys. This prevents them from computing the new root key. In a partition, the remaining members (in any surviving group fragment) reconstruct the tree where some bkeys are missing. In case of a merge of two groups, let us suppose that a taller (deeper) tree is merged with a shorter (shallower) tree . Similar to a partition, all members formerly in construct the new tree where some bkeys – those in – are missing. (This view is symmetric since the members in see the same tree but with missing bkeys in the subtree .) We now established that both partition and merge initially result in a new key tree with a number of missing bkeys. In the first round of merge protocol, sponsor in each group broadcasts the key tree after updating its session random. Upon receiving this broadcast message, every member rebuilds a key tree which has some missing bkeys. Filling up this bkeys takes at most rounds. A partition is very similar except the first broadcast message of merge. The apparent similarity between partition and merge allows us to collapse the protocols stemming from all mem- bership events into a single unified protocol. Figure 10 shows the pseudocode. The incentive for doing this is threefold. First, unification allows us to simplify the implementation and minimize its size. Second, the overall security and cor- rectness are easier to demonstrate with a single protocol. Third, we can now claim that (with a slight modification) TGDH is self-stabilizing and fault-tolerant as discussed below. 7 In a join, the new member simply generates its first share.
Sample 1Sample 2
Protocol Unification. Although described separately in the preceding sections, the four TGDH protocols: join, leave, merge and partition, actually represent different strands of a single protocol. We justify this claim with an informal argument below. Obviously, join and leave are special cases of merge and partition, respectively. It is less clear that merge and partition can be collapsed into a single protocol. To see why this is so we observe that, in either case, the key tree changes and remaining group members lack some number (sometimes none) of blinded keys which prevents them from computing the new root key unilaterally. When a partition occurs, the remaining members (in any surviving fragment) reconstruct the tree where some blinded keys are missing. In case of a merge, let us suppose that a taller (deeper) tree A is merged with a shorter (shallower) tree B. Similar to a partition, all members formerly in A construct the new tree where some blinded keys – those in B – are missing. (This view is symmetric since the members in B see the same tree but with missing blinded keys in the subtree A.) We established that both partition and merge initially result in a new key tree with a number of missing blinded keys. In case of merge, the missing blinded keys can be distributed in two rounds. This is because a sponsor in both of A and B broadcasts its own subtree including all blinded keys. Any member in a given subtree can compute the new root key after receiving both broadcasts. The case of partition is very similar except that the missing blinded keys are not concentrated in a new subtree (as in merge) but are, in the most general case, spread all around. As we discuss in section 5.4, every member reconstructs the key tree after a partition in at most h rounds, where h is the tree height. The merge scenario can be viewed as a special case of partition that always completes in two rounds. receive msg (msg type = membership event) construct new tree while there are missing blinded keys if (I can compute any missing keys) /* sponsor? */ compute missing blinded keys /* as many as possible */ broadcast new blinded keys endif receive msg (msg type = broadcast) /* including own broadcast */ update current tree endwhile Figure 10: Unified protocol pseudocode This apparent similarity between partition and merge allows us to lump the protocols stemming from all membership events into a single, unified protocol. (See figure 10 for the pseudocode.) The incentive for this is to simplify...
Sample 1
Protocol Unification. Although described separately in the preceding sections, the four STR operations: join, leave, merge and partition, actually represent different expression of a single protocol. We justify this claim with an informal argument below. Obviously, join and leave are special cases of merge and partition, re- spectively. It is less clear that merge and partition can be collapsed into A A A B A B a single protocol, because in either case, the key tree changes and the re- maining group members lack some number (sometimes none) of blinded keys or blinded session randoms which prevents them from computing the new root key. When a partition occurs, the remaining members re- construct the tree where some blinded keys are missing. In case of a merge, a shorter tree is merged into a taller tree . Any member in now can compute the group key since it knows blinded session ran- dom of any member in . The deepest member in also can compute the group key since it knows the blinded session random of any other member in and blinded group key of . Using the broadcast message any member now can compute the new group key.
Sample 1
Protocol Unification. Although described separately in the preceding sections, the four TGDH operations (join, leave, merge and partition) actually represent different strands of a single protocol. We justify this claim with an informal argument below.
Sample 1

Related to Protocol Unification

  • Protocols Each party hereby agrees that the inclusion of additional protocols may be required to make this Agreement specific. All such protocols shall be negotiated, determined and agreed upon by both parties hereto.

  • Information Technology Accessibility Standards Any information technology related products or services purchased, used or maintained through this Grant must be compatible with the principles and goals contained in the Electronic and Information Technology Accessibility Standards adopted by the Architectural and Transportation Barriers Compliance Board under Section 508 of the federal Rehabilitation Act of 1973 (29 U.S.C. §794d), as amended. The federal Electronic and Information Technology Accessibility Standards can be found at: xxxx://xxx.xxxxxx-xxxxx.xxx/508.htm.

  • Protocol No action to coerce or censor or penalize any negotiation participant shall be made or implied by any other member as a result of participation in the negotiation process.

  • COVID-19 Protocols Contractor will abide by all applicable COVID-19 protocols set forth in the District’s Reopening and COVID-19 Mitigation Plan and the safety guidelines for COVID-19 prevention established by the California Department of Public Health and the Ventura County Department of Public Health.

  • Joint Network Implementation and Grooming Process Upon request of either Party, the Parties shall jointly develop an implementation and grooming process (the “Joint Grooming Process” or “Joint Process”) which may define and detail, inter alia:

  • Project Implementation Manual The Recipient, through the PCU, shall: (i) take all action required to carry out Parts 1.1, 1.3, 1.4, 2, 3.1(b), 3.2, 3.3 and 4 (ii) of the Project in accordance with the provisions and requirements set forth or referred to in the Project Implementation Manual; (ii) submit recommendations to the Association for its consideration for changes and updates of the Project Implementation Manual as they may become necessary or advisable during Project implementation in order to achieve the objective of Parts 1.1, 1.3, 1.4, 2, 3.1(b), 3.2, 3.3 and 4(ii) of the Project; and (iii) not assign, amend, abrogate or waive the Project Implementation Manual or any of its provisions without the Association’s prior agreement. Notwithstanding the foregoing, if any of the provisions of the Project Implementation Manual is inconsistent with the provisions of this Agreement, the provisions of this Agreement shall prevail and govern.

  • Authorized User Overview and Mini-Bid Process Project Based IT Consulting Services Contracts enable Authorized Users to use a competitive Mini-bid Process to acquire Services on an as-needed basis, for qualified IT Projects. Project Based IT Consulting Services may include, but will not be limited to projects requiring: analysis, data classification, design, development, testing, quality assurance, security and associated training for Information Technology based applications. See section 1.3 Out of Scope Work for a listing of projects expressly excluded from the scope of this Contract. An Authorized User Agreement for Project Based IT Consulting Services will be governed first by the terms and conditions specified in the OGS Centralized Contract and second by terms and conditions added to the Authorized User Statement of Work. Additional terms and conditions shall not conflict with or modify the terms and conditions of the OGS Centralized Contract. NYS Executive Agencies must adhere to all internal processes and approvals including, as required, approval from NYS Office of Information Technology Services. Other Authorized Users must adhere to their own internal processes and approvals. In accordance with Appendix B, section 28, Modification of Contract Terms, an Authorized User may add additional required terms and conditions to this Mini-Bid and resultant Authorized User Agreement only if such terms and conditions (1) are more favorable to the Authorized User and (2) do not conflict with or supersede the OGS Centralized Contract terms and conditions. Examples of additional terms and conditions include: • Expedited delivery timeframe; • Additional incentives, such as discount for expedited payment/Procurement Card use; and • Any additional requirements imposed by the funding source or Federal law.

  • Access to Network Interface Device (NID 2.4.3.1. Due to the wide variety of NIDs utilized by BellSouth (based on subscriber size and environmental considerations), Mpower may access the on-premises wiring by any of the following means: BellSouth shall allow Mpower to connect its loops directly to BellSouth’s multi-line residential NID enclosures that have additional space and are not used by BellSouth or any other telecommunications carriers to provide service to the premise. Mpower agrees to install compatible protectors and test jacks and to maintain the protection system and equipment and to indemnify BellSouth pursuant to Section 8 of the General Terms and Conditions of this Agreement.

  • Product Safety Seller must maintain the state of the product so that it is able to perform to its designed or intended purpose without causing unacceptable risk of harm to a person or damage to property.

  • Research Use Reporting To assure adherence to NIH GDS Policy, the PI agrees to provide annual Progress Updates as part of the annual Project Renewal or Project Close-out processes, prior to the expiration of the one (1) year data access period. The PI who is seeking Renewal or Close-out of a project agree to complete the appropriate online forms and provide specific information such as how the data have been used, including publications or presentations that resulted from the use of the requested dataset(s), a summary of any plans for future research use (if the PI is seeking renewal), any violations of the terms of access described within this Agreement and the implemented remediation, and information on any downstream intellectual property generated from the data. The PI also may include general comments regarding suggestions for improving the data access process in general. Information provided in the progress updates helps NIH evaluate program activities and may be considered by the NIH GDS governance committees as part of NIH’s effort to provide ongoing stewardship of data sharing activities subject to the NIH GDS Policy.

Time is Money Join Law Insider Premium to draft better contracts faster.