{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/9605"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/9605","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Anonymous Multicast Communication for Wireless Networks Using Layered Encryption and Hashing","abstract":"A sensor network consists of autonomous sensors that operate cooperatively to monitor sensitive information in various environments. A sensor node often sends the information to the base node(s). The base nodes contain the important information, often making them the target of their adversaries. More and more sensor network applications require multicasting to multiple base nodes, and anonymity of the base nodes have become an important aspect of communication in wireless sensor networks. Limited capabilities of the sensor node and a need of multicasting make the issue of anonymity more challenging. We propose a technique for multiple receiver anonymity. Our solution is based on the layered encryption and hashing for multicasting the data to multiple receivers without compromising the identity of the receiver. We present layered encryption and hashing (LEH) approach for this problem. Our approach uses hash ID to identify as well as randomize a node. Layered encryption provides the confidentiality. Through simulations, we demonstrate that our proposed solution can work efficiently and provide the sink node anonymity for wireless sensor networks.","abstract_html":"A sensor network consists of autonomous sensors that operate cooperatively to monitor sensitive information in various environments. A sensor node often sends the information to the base node(s). The base nodes contain the important information, often making them the target of their adversaries. More and more sensor network applications require multicasting to multiple base nodes, and anonymity of the base nodes have become an important aspect of communication in wireless sensor networks. Limited capabilities of the sensor node and a need of multicasting make the issue of anonymity more challenging. We propose a technique for multiple receiver anonymity. Our solution is based on the layered encryption and hashing for multicasting the data to multiple receivers without compromising the identity of the receiver. We present layered encryption and hashing (LEH) approach for this problem. Our approach uses hash ID to identify as well as randomize a node. Layered encryption provides the confidentiality. Through simulations, we demonstrate that our proposed solution can work efficiently and provide the sink node anonymity for wireless sensor networks.","abstract_has_math":false,"creators":["Lopes, Joel, 1985-"],"institution":"University of Missouri--Kansas City","degree_name":"M.S.","degree_level":"Masters","degree_discipline":"Computer Science (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Choi, Baek-Young"],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010","date_published":"2010","updated_at":"2026-07-24T05:16:32Z","subjects":["Hashing anonymity","Onion ring","Receiver anonymity"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10355/9605","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Choi, Baek-Young"]},{"key":"dc:creator","label":"Author","values":["Lopes, Joel, 1985-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-01-20T20:22:06Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-01-20T20:22:06Z"]},{"key":"dc:date.issued","label":"Date","values":["2010"]},{"key":"dc:publisher","label":"Institution","values":["University of Missouri--Kansas City"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Hashing anonymity","Onion ring","Receiver anonymity"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10355/9605"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed on January 20, 2011.","Thesis advisor: Baek-Young Choi.","Vita.","Includes bibliographic references (pages 41-43).","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2010."]},{"key":"dc:description.abstract","label":"Abstract","values":["A sensor network consists of autonomous sensors that operate cooperatively to monitor sensitive information in various environments. A sensor node often sends the information to the base node(s). The base nodes contain the important information, often making them the target of their adversaries. More and more sensor network applications require multicasting to multiple base nodes, and anonymity of the base nodes have become an important aspect of communication in wireless sensor networks. Limited capabilities of the sensor node and a need of multicasting make the issue of anonymity more challenging. We propose a technique for multiple receiver anonymity. Our solution is based on the layered encryption and hashing for multicasting the data to multiple receivers without compromising the identity of the receiver. We present layered encryption and hashing (LEH) approach for this problem. Our approach uses hash ID to identify as well as randomize a node. Layered encryption provides the confidentiality. Through simulations, we demonstrate that our proposed solution can work efficiently and provide the sink node anonymity for wireless sensor networks."]},{"key":"dc:title","label":"Title","values":["Anonymous Multicast Communication for Wireless Networks Using Layered Encryption and Hashing"]}]}],"canonical_facts":{"dc:contributor.advisor":["Choi, Baek-Young"],"dc:creator":["Lopes, Joel, 1985-"],"dc:date.accessioned":["2011-01-20T20:22:06Z"],"dc:date.available":["2011-01-20T20:22:06Z"],"dc:date.issued":["2010"],"dc:description":["Title from PDF of title page, viewed on January 20, 2011.","Thesis advisor: Baek-Young Choi.","Vita.","Includes bibliographic references (pages 41-43).","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2010."],"dc:description.abstract":["A sensor network consists of autonomous sensors that operate cooperatively to monitor sensitive information in various environments. A sensor node often sends the information to the base node(s). The base nodes contain the important information, often making them the target of their adversaries. More and more sensor network applications require multicasting to multiple base nodes, and anonymity of the base nodes have become an important aspect of communication in wireless sensor networks. Limited capabilities of the sensor node and a need of multicasting make the issue of anonymity more challenging. We propose a technique for multiple receiver anonymity. Our solution is based on the layered encryption and hashing for multicasting the data to multiple receivers without compromising the identity of the receiver. We present layered encryption and hashing (LEH) approach for this problem. Our approach uses hash ID to identify as well as randomize a node. Layered encryption provides the confidentiality. Through simulations, we demonstrate that our proposed solution can work efficiently and provide the sink node anonymity for wireless sensor networks."],"dc:identifier.uri":["http://hdl.handle.net/10355/9605"],"dc:language.iso":["en_US"],"dc:publisher":["University of Missouri--Kansas City"],"dc:subject":["Hashing anonymity","Onion ring","Receiver anonymity"],"dc:title":["Anonymous Multicast Communication for Wireless Networks Using Layered Encryption and Hashing"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science (UMKC)"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:16:32Z"}