Common use of Xxxxxxxxx and X Clause in Contracts

Xxxxxxxxx and X. Xxxxxxx. A secure and efficient con- xxxxxxx key distribution system. In Advances in Cryptology – EUROCRYPT ’94, volume 950 of Lecture Notes in Computer Science, pages 275–286. Springer-Verlag, 1995. [2] X. Xxxxxx and X. Xxxxxxx. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644– 654, 1976. [3] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Simple and fault-tolerant key agreement for dynamic collaborative groups. Proc. of 7th ACM Conference on Computer and Communications Se- curity, pages 235–244, November 2000. [4] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Communication-efficient group key agreement. Information Systems Security, Pro- ceedings of the 17th International Information Security Con- xxxxxxx IFIP SEC’01, November 2001. [5] X. X. X. Xxx, J. C. S. Lui, and D. K. Y. Yau. Distributed col- laborative key agreement protocols for dynamic peer groups. Technical report cs-tr-2002-04, Dept of Computer Science and Engineering, Chinese University of Hong Kong, May 2002. Also as CS TR-02-013, Purdue University, West Lafayette, IN. [6] X. S. Xx, X. X. Xxxx, X. X. Xxxxx, and X. X. Xxx. Batch rekeying for secure group communications. Proceedings of Tenth International World Wide Web Conference (WWW10), May 2001. [7] X. Xxxxx, X. Xxxxxxx, and X. Xxxxxxx. Kronos: A scalable group re-keying approach for secure multicast. Proc. of IEEE Sym- posium on Security and Privacy 2000, May 2000. [8] X. Xxxxxxxxx. Cryptography and Network Security: Princi- ples and Practice. Prentice Hall, 2nd edition, 1999. [9] X. Xxxxxxx, X. Xxxxxx, and X. Xxxxxxx. CLIQUES: A new approach to group key agreement. IEEE International Xxx- xxxxxxx on Distributed Computing Systems, pages 380–387, May 1998. [10] X. X. Xxxxxxx, X. X. Xxxxxx, and X. X. Xxxx. Key man- agement for multicast: Issues and architectures. Inter- net draft draft-xxxxxxx-key-arch-00.txt, Internet Engineering Task Force, July 1999. Expires in six months. [11] X. X. Xxxx, X. Xxxxx, and X. X. Xxx. Secure group com- munications using key graphs. Proc. of ACM SIGCOMM’98, September 1998. [12] Y. R. Xxxx, X. S. Li, X. B. Xxxxx, and X. X. Xxx. Reli- able group rekeying: A performance analysis. Proc. of ACM SIGCOMM’01, August 2001. Average number of exponentiations 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves

Xxxxxxxxx and X. Xxxxxxx. A secure and efficient effi cient con- xxxxxxx key distribution system. In Advances in Cryptology – EUROCRYPT ’94, volume 950 of Lecture Notes in Computer Science, pages 275–286. Springer-Verlag, 1995. [2] X. Xxxxxx Xxxxx e and X. Xxxxxxx. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644– 654, 1976. [3] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Simple and fault-tolerant key agreement for dynamic collaborative groups. Proc. of 7th ACM Conference on Computer and Communications Se- curity, pages 235–244, November 2000. [4] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Communication-efficient effi cient group key agreement. Information Systems Security, Pro- ceedings of the 17th International Information Security Con- xxxxxxx IFIP SEC’01, November 2001. [5] X. X. X. Xxx, J. C. S. Lui, and D. K. Y. Yau. Distributed col- laborative key agreement protocols for dynamic peer groups. Technical report cs-tr-2002-04report, Dept of Computer Science and EngineeringEngineer- ing, Chinese University of Hong Kong, May August 2002. Also as CS TR-02-013, Purdue University, West Lafayette, IN. [6] X. S. Xx, X. X. Xxxx, X. X. Xxxxx, and X. X. Xxx. Batch rekeying for secure group communications. Proceedings of Tenth International World Wide Web Conference (WWW10), May 2001. [7] X. Xxxxx, X. Xxxxxxx, and X. Xxxxxxx. Kronos: A scalable group re-keying approach for secure multicast. Proc. of IEEE Sym- posium on Security and Privacy 2000, May 2000. [8] X. Xxxxxxxxx. Cryptography and Network Security: Princi- ples and Practice. Prentice Hall, 2nd edition, 1999. [9] X. Xxxxxxx, X. Xxxxxx, and X. Xxxxxxx. CLIQUES: A new approach to group key agreement. IEEE International Xxx- xxxxxxx on Distributed Computing Systems, pages 380–387, May 1998. [10] X. X. Xxxxxxx, X. X. Xxxxxx, and X. X. Xxxx. Key man- agement for multicast: Issues and architectures. Inter- net draft draft-xxxxxxx-key-arch-00.txt, Internet Engineering Task Force, July 1999. Expires in six months. [11] X. X. Xxxx, X. Xxxxx, and X. X. Xxx. Secure group com- munications using key graphs. Proc. of ACM SIGCOMM’98, September 1998. [12] Y. R. Xxxx, X. S. Li, X. B. Xxxxx, and X. X. Xxx. Reli- able group rekeying: A performance analysis. Proc. of ACM SIGCOMM’01, August 2001. Average number of exponentiations 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (a) = 128 9000 Average number of exponentiations 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (b) = 256 10000 Average number of exponentiations 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves

Xxxxxxxxx and X. Xxxxxxx, A Secure and Effi- cient Conference Key Distribution System, Proc. A secure and efficient con- xxxxxxx key distribution systemof EUROCRYPT’94, LNCS 950, pp. In Advances in Cryptology – EUROCRYPT ’94, volume 950 of Lecture Notes in Computer Science, pages 275–286275-286. Springer-Verlag, 1995. [2] X. Xxxxxx and X. Xxxxxxx. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644– 654, 1976May 1994. [3] X. Xxx, X. Xxxxxx, Xxxxxxxxxxx and X. XxxxxxXxxxx, Security Arguments for Digital Signatures and Blind Signatures, J. of Cryptology, vol. Simple and fault13, pp. 361-tolerant key agreement for dynamic collaborative groups. Proc. of 7th ACM Conference on Computer and Communications Se- curity396, pages 235–244, November 2000. [4] X. XxxXxxxxxx, X. XxxxxxXxxxxxxxx, X. Xxxxxxxxxxx, and X. XxxxxxXxxxxxxxxx. CommunicationProvably Authenticated Group Xxxxxx- Xxxxxxx Key Exchange, 8th ACM conference on Computer and Communications Security (CCS’01), pages 255-efficient group key agreement264. Information Systems SecurityACM Press, Pro- ceedings of the 17th International Information Security Con- xxxxxxx IFIP SEC’01, November 2001. [5] X. Xxxxx and X. X. XxxXxxxxxxx, J. C. S. LuiIdentity-based encryp- tion from the Weil pairing, and D. K. Y. YauProc. Distributed col- laborative key agreement protocols for dynamic peer groups. Technical report csof Crypto’01, LNCS 2139, pp.213-tr-2002229, Springer-04Verlag, Dept of Computer Science and Engineering, Chinese University of Hong Kong, May 2002. Also as CS TR-02-013, Purdue University, West Lafayette, IN2001. [6] X. S. Xxxx and X. Xxxx, Scalable Protocols for Authenticated Group Key Exchange, Proc. of Crypto’03, LNCS 2729, pp.110-125, Springer, 2003. [7] X. X. Xxxxx and X.F. Xxxx, Attack on Two ID-based Authenticated Group Key Agreement Schemes, Cryptology ePrint Archive: Report 2003/259. [8] X. X. Xxxx, X. X. Xxxxx and X. X. Xxx, Effi- cient ID- based Group Key Agreement with Bilinear Maps, Proc. of PKC’04, LNCS 2947, pp.130-144, Springer-Verlag, 2004. [9] X. X. Xxx, X. X. Xxx, X. X. Xx, and X. X. Xxx, One Round Identity-Based Authenticated Confer- ence Agreement Protocol, Proc. of ECUMN 2004, LNCS 3262, pp.407-416, Springer-Verlag, 2004. [10] X. Xxx, X. Xxxx, and X. Xx, ID-Based One Round Authenticated Group Key Agreement Pro- tocol with Bilinear Pairings, Proc. of International Conference on Information Technology: Coding and Computing (ITCC’05), vol.I, pp.757-761, 2005. [11] X. Xxxx, X. X. Xxxxx, and X. X. Xxx. , Batch rekeying for secure group communications. Proceedings of Tenth International World Wide Web Conference (WWW10)verifica- tions with ID-based signatures, May 2001. [7] X. Xxxxx, X. Xxxxxxx, and X. Xxxxxxx. Kronos: A scalable group re-keying approach for secure multicast. Proc. of IEEE Sym- posium on Security and Privacy 2000ICISC ’04, May 2000LNCS 3506, pp.233-248, Springer-Verlag, 2005. [812] X. Xxxxxxxxx. Cryptography and Network Security: Princi- ples and Practice. Prentice Hall, 2nd edition, 1999. [9] X. XxxxxxxXxxx, X. Xxxxxx, and X. XxxxxxxMu, Efficient ID-based Authenticated Group Key Agreement from Bilin- ear Pairings, Proc. CLIQUES: A new approach to group key agreement. IEEE International Xxx- xxxxxxx on Distributed Computing Systemsof Mobile Ad-hoc and Sensor Networks (MSN 2006), pages 380–387LNCS 4325, May 1998pp.521-532, Springer-Verlag, 2006. [1013] X. X. XxxxxxxXxxx, X. X. XxxxxxFurther Analysis of ID-Based Authen- ticated Group Key Agreement Protocol from Bilin- ear Maps, and X. X. XxxxIEICE Trans. Key man- agement for multicast: Issues and architectures. Inter- net draft draft-xxxxxxx-key-arch-00.txtFundamentals, Internet Engineering Task Forcevol.E90-A, July 1999. Expires in six monthsno.1, pp.231-233, 2007. [1114] X. X. Xxxx, X. Xxxxx, X. Xxxxx and X. X. Xxx, ID- Based Authenticated Group Key Agreement Secure against Insider Attacks, IEICE Trans. Secure group com- munications using key graphs. Proc. of ACM SIGCOMM’98Fundamen- tals, September 1998. [12] Y. R. Xxxxvol.E91-A, X. S. Lino.7, X. B. Xxxxxpp.1828-1830, and X. X. Xxx. Reli- able group rekeying: A performance analysis. Proc. of ACM SIGCOMM’01, August 2001. Average number of exponentiations 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves2008.

Xxxxxxxxx and X. Xxxxxxx. A secure and efficient con- xxxxxxx key distribution system. In Advances in Cryptology – EUROCRYPT ’94, volume 950 of Lecture Notes in Computer Science, pages 275–286. Springer-Verlag, 1995. [2] X. Xxxxxx and X. Xxxxxxx. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644– 654, 1976. [3] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Simple and fault-tolerant key agreement for dynamic collaborative groups. Proc. of 7th ACM Conference on Computer and Communications Se- curity, pages 235–244, November 2000. [4] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Communication-efficient group key agreement. Information Systems Security, Pro- ceedings of the 17th International Information Security Con- xxxxxxx IFIP SEC’01, November 2001. [5] X. X. X. Xxx, J. C. S. Lui, and D. K. Y. Yau. Distributed col- laborative key agreement protocols for dynamic peer groups. Technical report cs-tr-2002-04, Dept of Computer Science and Engineering, Chinese University of Hong Kong, May 2002. Also as CS TR-02-013, Purdue University, West Lafayette, IN. [6] X. S. Xx, X. X. Xxxx, X. X. Xxxxx, and X. X. Xxx. Batch rekeying for secure group communications. Proceedings of Tenth International World Wide Web Conference (WWW10), May 2001. [7] X. Xxxxx, X. Xxxxxxx, and X. Xxxxxxx. Kronos: A scalable group re-keying approach for secure multicast. Proc. of IEEE Sym- posium on Security and Privacy 2000, May 2000. [8] X. Xxxxxxxxx. Cryptography and Network Security: Princi- ples and Practice. Prentice Hall, 2nd edition, 1999. [9] X. Xxxxxxx, X. Xxxxxx, and X. Xxxxxxx. CLIQUES: A new approach to group key agreement. IEEE International Xxx- xxxxxxx on Distributed Computing Systems, pages 380–387, May 1998. [10] X. X. Xxxxxxx, X. X. Xxxxxx, and X. X. Xxxx. Key man- agement for multicast: Issues and architectures. Inter- net draft draft-xxxxxxx-key-arch-00.txt, Internet Engineering Task Force, July 1999. Expires in six months. [11] X. X. Xxxx, X. Xxxxx, and X. X. Xxx. Secure group com- munications using key graphs. Proc. of ACM SIGCOMM’98, September 1998. [12] Y. R. Xxxx, X. S. Li, X. B. Xxxxx, and X. X. Xxx. Reli- able group rekeying: A performance analysis. Proc. of ACM SIGCOMM’01, August 2001. Average number of exponentiations 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (a) = 128 9000 Average number of exponentiations 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (b) = 256 10000 Average number of exponentiations 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves

Xxxxxxxxx and X. Xxxxxxx. A secure and efficient effi cient con- xxxxxxx key distribution system. In Advances in Cryptology – EUROCRYPT ’94, volume 950 of Lecture Notes in Computer Science, pages 275–286. Springer-Verlag, 1995. [2] X. Xxxxxx Xxxxx e and X. Xxxxxxx. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644– 654, 1976. [3] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Simple and fault-tolerant key agreement for dynamic collaborative groups. Proc. of 7th ACM Conference on Computer and Communications Se- curity, pages 235–244, November 2000. [4] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Communication-efficient effi cient group key agreement. Information Systems Security, Pro- ceedings of the 17th International Information Security Con- xxxxxxx IFIP SEC’01, November 2001. [5] X. X. X. Xxx, J. C. S. Lui, and D. K. Y. Yau. Distributed col- laborative key agreement protocols for dynamic peer groups. Technical report cs-tr-2002-04report, Dept of Computer Science and EngineeringEngineer- ing, Chinese University of Hong Kong, May August 2002. Also as CS TR-02-013, Purdue University, West Lafayette, IN. [6] X. S. Xx, X. X. Xxxx, X. X. Xxxxx, and X. X. Xxx. Batch rekeying for secure group communications. Proceedings of Tenth International World Wide Web Conference (WWW10), May 2001. [7] X. Xxxxx, X. Xxxxxxx, and X. Xxxxxxx. Kronos: A scalable group re-keying approach for secure multicast. Proc. of IEEE Sym- posium on Security and Privacy 2000, May 2000. [8] X. Xxxxxxxxx. Cryptography and Network Security: Princi- ples and Practice. Prentice Hall, 2nd edition, 1999. [9] X. Xxxxxxx, X. Xxxxxx, and X. Xxxxxxx. CLIQUES: A new approach to group key agreement. IEEE International Xxx- xxxxxxx on Distributed Computing Systems, pages 380–387, May 1998. [10] X. X. Xxxxxxx, X. X. Xxxxxx, and X. X. Xxxx. Key man- agement for multicast: Issues and architectures. Inter- net draft draft-xxxxxxx-key-arch-00.txt, Internet Engineering Task Force, July 1999. Expires in six months. [11] X. X. Xxxx, X. Xxxxx, and X. X. Xxx. Secure group com- munications using key graphs. Proc. of ACM SIGCOMM’98, September 1998. [12] Y. R. Xxxx, X. S. Li, X. B. Xxxxx, and X. X. Xxx. Reli- able group rekeying: A performance analysis. Proc. of ACM SIGCOMM’01, August 2001. Average number of exponentiations 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (a) = 128 9000 Average number of exponentiations 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (b) = 256 10000 Average number of exponentiations 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (c) = 384 Figure 8. Average number of exponentiations at different numbers of joins when the original tree is completely balanced Average number of renewed nodes 700 600 500 400 300 200 100 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (a) = 128 800 Average number of renewed nodes 700 600 500 400 300 200 100 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (b) = 256 900 Average number of renewed nodes 800 700 600 500 400 300 200 100 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves

Xxxxxxxxx and X. Xxxxxxx. A secure and efficient con- xxxxxxx key distribution system. In Advances in Cryptology – EUROCRYPT ’94, volume 950 of Lecture Notes in Computer Science, pages 275–286. Springer-Verlag, 1995. [2] X. Xxxxxx and X. Xxxxxxx. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644– 654, 1976. [3] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Simple and fault-tolerant key agreement for dynamic collaborative groups. Proc. of 7th ACM Conference on Computer and Communications Se- curity, pages 235–244, November 2000. [4] X. Xxx, X. Xxxxxx, and X. Xxxxxx. Communication-efficient group key agreement. Information Systems Security, Pro- ceedings of the 17th International Information Security Con- xxxxxxx IFIP SEC’01, November 2001. [5] X. X. X. Xxx, J. C. S. Lui, and D. K. Y. Yau. Distributed col- laborative key agreement protocols for dynamic peer groups. Technical report cs-tr-2002-04, Dept of Computer Science and Engineering, Chinese University of Hong Kong, May 2002. Also as CS TR-02-013, Purdue University, West Lafayette, IN. [6] X. S. Xx, X. X. Xxxx, X. X. Xxxxx, and X. X. Xxx. Batch rekeying for secure group communications. Proceedings of Tenth International World Wide Web Conference (WWW10), May 2001. [7] X. Xxxxx, X. S. Xxxxxxx, and X. Xxxxxxx. Kronos: A scalable group re-keying approach for secure multicast. Proc. of IEEE Sym- posium on Security and Privacy 2000, May 2000. [8] X. Xxxxxxxxx. Cryptography and Network Security: Princi- ples and Practice. Prentice Hall, 2nd edition, 1999. [9] X. Xxxxxxx, X. Xxxxxx, and X. Xxxxxxx. CLIQUES: A new approach to group key agreement. IEEE International Xxx- xxxxxxx on Distributed Computing Systems, pages 380–387, May 1998. [10] X. X. Xxxxxxx, X. X. Xxxxxx, and X. X. Xxxx. Key man- agement for multicast: Issues and architectures. Inter- net draft draft-xxxxxxx-key-arch-00.txt, Internet Engineering Task Force, July 1999. Expires in six months. [11] X. X. Xxxx, X. Xxxxx, and X. X. Xxx. Secure group com- munications using key graphs. Proc. of ACM SIGCOMM’98, September 1998. [12] Y. R. X. X. Xxxx, X. S. LiXx, X. B. X. Xxxxx, and X. X. Xxx. Reli- able group rekeying: A performance analysis. Proc. of ACM SIGCOMM’01, August 2001. Average number of exponentiations 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (a) = 128 9000 Average number of exponentiations 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (b) = 256 10000 Average number of exponentiations 9000 8000 7000 6000 5000 4000 3000 2000 1000 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (c) = 384 Figure 8. Average number of exponentiations at different numbers of joins when the original tree is completely balanced Average number of renewed nodes 700 600 500 400 300 200 100 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (a) = 128 800 Average number of renewed nodes 700 600 500 400 300 200 100 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves (b) = 256 900 Average number of renewed nodes 800 700 600 500 400 300 200 100 0 Rebuild Batch Queue-batch 0 000 000 000 400 500 Number of leaves