<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000ctm a22000004a 4500</leader>
  <controlfield tag="001">UP-99796217608175395</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20230503092542.0</controlfield>
  <controlfield tag="006">m    |o  d |      </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">070926s2005    xx      r    |||| u|eng d</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPD-00000528689</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DML</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
   <subfield code="a">DMLUC</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
   <subfield code="a">LG 995 2005 C65</subfield>
   <subfield code="b">H6</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Ho Hai Van</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="3">
   <subfield code="a">An improvement on logical key hierarchy algorithm for multicast and group security</subfield>
   <subfield code="c">Ho Hai Van.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="c">2005.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">ix, 81 leaves</subfield>
   <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
   <subfield code="a">Thesis (M.S. Computer Science)--University of the Philippines, Diliman.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Multicast enables efficient group communication by allowing the sender to transmit a single copy of data, with network elements such as routers and switches making copies as necessary for the receivers. Thus, multicast reduces the computational load at the sender, as well as the number of copies of data on the network. For the successful deployment of group communication applications, multicast security is one of the important problems to solve together with other issues such as traffic management, accounting and biling, and reliability. With respect to security, key distribution is regarded as one of the most difficult challenges so far. The group key should be changed when the membership of the group changes so that departed members cannot decrypt the future group data and new members cannot decrypt the past group data. One fundamental question is how the group key can be efficiently distributed to so many group members when group membership changes in a dynamic fashion. This thesis proposes an improvement on the Logical Key Hierarchy (LKH) algorithm that facilitates efficient distribution of a group key to very large (up to 100,000 members) and dynamic (the period between two membership changes is less than 30 seconds) groups. First, we discuss the LKH algorithm and analyze its overheads such as receiver or key server computation and communication bandwidth. Next, we propose a new variation of the LKH algorithm and evaluate its performance compared to the original LKH. The idea is to reduce LKH overheads by minimizing the height of the logical tree. This is achieved by grouping users into different trees instead of one. Finally, we supplement this analysis by providing a simulation program based on Java Network Simulator (JNS) to demonstrate the advantages of the new algorithm.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Multicasting (Computer networks)</subfield>
   <subfield code="x">Security measures.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer networks</subfield>
   <subfield code="x">Security measures.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Data encryption (Computer Science).</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Multichannel communication.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Broadband communication systems.</subfield>
  </datafield>
  <datafield tag="842" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DARCHIVES</subfield>
   <subfield code="h">LG 995 2005 C65 H6</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DENG-II</subfield>
   <subfield code="h">LG 995 2005 C65</subfield>
   <subfield code="i">H6</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
