Common use of Our Work Clause in Contracts

Our Work. In this paper, we propose a novel Authenticated, Fault-tolerant Tree-based ▇▇▇▇▇▇-▇▇▇▇▇▇▇ key agreement protocol, AFTD, based on two key ideas. First, as explained in Section 3, it is gross overkill to broadcast updated public keys to all group members for recomputing the group key when a node ni joins or leaves. It suffices to send each update to a much smaller subset of nodes in the tree, called its trust set TS(ni). Second, we achieve robust key authentication by distributing the function of trusted authority among the nodes in TS(ni), using a threshold cryptographic scheme. Any k members of a node’s trust set can serve as its public key certificate authority. Our performance analysis shows this scheme can reduces the communication overhead from O(n2) to O(n log n) for initialization, and from O(n log n) to O(n) for rekeying. It also reduces the storage requirement for blinded keys from O(n) to O(log n). This feature is particularly useful when a broadcast channel is unavailable.‌ The rest of this paper is organized as follows. We survey related work in Section 2. Section 3 motivates our work and defines our intrusion model. We present our solution in Section 4 and demonstrate performance analysis and comparison in Section 5. Finally we make a conclusion in Section 6.

Our Work. In this paper, we propose a novel Authenticated, Fault-tolerant Tree-based ▇▇▇▇▇▇-▇▇▇▇▇▇▇ key agreement protocol, AFTD, based on two key ideas. First, as explained in Section 3, it is gross overkill to broadcast updated public keys to all group members for recomputing the group key when a node ni joins or leaves. It suffices suffices to send each update to a much smaller subset of nodes in the tree, called its trust set TS(ni). Second, we achieve robust key authentication by distributing the function of trusted authority among the nodes in TS(ni), using a threshold cryptographic scheme. Any k members of a node’s trust set can serve as its public key certificate certificate authority. Our performance analysis shows this scheme can reduces the communication overhead from O(n2) to O(n log n) for initialization, and from O(n log n) to O(n) for rekeying. It also reduces the storage requirement for blinded keys from O(n) to O(log n). This feature is particularly useful when a broadcast channel is unavailable.‌ The rest of this paper is organized as follows. We survey related work in Section 2. Section 3 motivates our work and defines defines our intrusion model. We present our solution in Section 4 and demonstrate performance analysis and comparison in Section 5. Finally we make a conclusion in Section 6.