Deepa Kundur’s Google Scholar Page.
2008 |
William Luh Distributed Secrecy for Information Theoretic Sensor Network Models (PhD Thesis) Texas A&M University, 2008. @phdthesis{LuhPhDThesis08, title = {Distributed Secrecy for Information Theoretic Sensor Network Models}, author = {William Luh}, year = {2008}, date = {2008-08-15}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {This dissertation presents a novel problem inspired by the characteristics of sensor networks. The basic setup through-out the dissertation is that a set of sensor nodes encipher their data without collaboration and without any prior shared secret materials. The challenge is dealt by an eavesdropper who intercepts a subset of the enciphered data and wishes to gain knowledge of the uncoded data. This problem is challenging and novel given that the eavesdropper is assumed to know everything, including secret cryptographic keys used by both the encoders and decoders. We study the above problem using information theoretic models as a necessary first step towards an understanding of the characteristics of this system problem. This dissertation contains four parts. The first part deals with noiseless channels, and the goal is for sensor nodes to both source code and encipher their data. We derive inner and outer regions of the capacity region (i.e the set of all source coding and equivocation rates) for this problem under general distortion constraints. The main conclusion in this part is that unconditional secrecy is unachievable unless the distortion is maximal, rendering the data useless. In the second part we thus provide a practical coding scheme based on distributed source coding using syndromes (DISCUS) that provides secrecy beyond the equivocation measure, i.e. secrecy on each symbol in the message. The third part deals with discrete memoryless channels, and the goal is for sensor nodes to both channel code and encipher their data. We derive inner and outer regions to the secrecy capacity region, i.e. the set of all channel coding rates that achieve (weak) unconditional secrecy. The main conclusion in this part is that interference allows (weak) unconditional secrecy to be achieved in contrast with the first part of this dissertation. The fourth part deals with wireless channels with fading and additive Gaussian noise. We derive a general outer region and an inner region based on an equal SNR assumption, and show that the two are partially tight when the maximum available user powers are admissible.}, type = {Ph.D. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {phdthesis} } This dissertation presents a novel problem inspired by the characteristics of sensor networks. The basic setup through-out the dissertation is that a set of sensor nodes encipher their data without collaboration and without any prior shared secret materials. The challenge is dealt by an eavesdropper who intercepts a subset of the enciphered data and wishes to gain knowledge of the uncoded data. This problem is challenging and novel given that the eavesdropper is assumed to know everything, including secret cryptographic keys used by both the encoders and decoders. We study the above problem using information theoretic models as a necessary first step towards an understanding of the characteristics of this system problem. This dissertation contains four parts. The first part deals with noiseless channels, and the goal is for sensor nodes to both source code and encipher their data. We derive inner and outer regions of the capacity region (i.e the set of all source coding and equivocation rates) for this problem under general distortion constraints. The main conclusion in this part is that unconditional secrecy is unachievable unless the distortion is maximal, rendering the data useless. In the second part we thus provide a practical coding scheme based on distributed source coding using syndromes (DISCUS) that provides secrecy beyond the equivocation measure, i.e. secrecy on each symbol in the message. The third part deals with discrete memoryless channels, and the goal is for sensor nodes to both channel code and encipher their data. We derive inner and outer regions to the secrecy capacity region, i.e. the set of all channel coding rates that achieve (weak) unconditional secrecy. The main conclusion in this part is that interference allows (weak) unconditional secrecy to be achieved in contrast with the first part of this dissertation. The fourth part deals with wireless channels with fading and additive Gaussian noise. We derive a general outer region and an inner region based on an equal SNR assumption, and show that the two are partially tight when the maximum available user powers are admissible. |
Alexandra Czarlinska Stealthy Attacks and Defense Strategies in Competing Sensor Networks (PhD Thesis) Texas A&M University, 2008. @phdthesis{CzaPhDThesis08, title = {Stealthy Attacks and Defense Strategies in Competing Sensor Networks}, author = {Alexandra Czarlinska}, year = {2008}, date = {2008-08-01}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {The fundamental objective of sensor networks underpinning a variety of applications is the collection of reliable information from the surrounding environment. The correctness of the collected data is especially important in applications involving societal welfare and safety, in which the acquired information may be utilized by end-users for decision-making. The distributed nature of sensor networks and their deployment in unattended and potentially hostile environments, however, renders this collection task challenging for both scalar and visual data. In this work we propose and address the twin problem of carrying out and defending against a stealthy attack on the information gathered by a sensor network at the physical sensing layer as perpetrated by a competing hostile network. A stealthy attack in this context is an intelligent attempt to disinform a sensor network in a manner that mitigates attack discovery. In comparison with previous sensor network security studies, we explicitly model the attack scenario as an active competition between two networks where difficulties arise from the pervasive nature of the attack, the possibility of tampering during data acquisition prior to encryption, and the lack of prior knowledge regarding the characteristics of the attack We examine the problem from the perspective of both the hostile and the legitimate network. The interaction between the networks is modeled as a game where a stealth utility is derived and shown to be consistent for both players in the case of stealthy direct attacks and stealthy cross attacks. Based on the stealth utility, the optimal attack and defense strategies are obtained for each network. For the legitimate network, minimization of the attacker’s stealth results in the possibility of attack detection through established paradigms and the ability to mitigate the power of the attack. For the hostile network, maximization of the stealth utility translates into the optimal attack avoidance. This attack avoidance does not require active communication among the hostile nodes but rather relies on a level of coordination which we quantify. We demonstrate the significance and effectiveness of the solution for sensor networks acquiring scalar and multidimensional data such as surveillance sequences and relate the results to existing image sensor networks. Finally we discuss the implications of these results for achieving secure event acquisition in unattended environments.}, type = {Ph.D. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {phdthesis} } The fundamental objective of sensor networks underpinning a variety of applications is the collection of reliable information from the surrounding environment. The correctness of the collected data is especially important in applications involving societal welfare and safety, in which the acquired information may be utilized by end-users for decision-making. The distributed nature of sensor networks and their deployment in unattended and potentially hostile environments, however, renders this collection task challenging for both scalar and visual data. In this work we propose and address the twin problem of carrying out and defending against a stealthy attack on the information gathered by a sensor network at the physical sensing layer as perpetrated by a competing hostile network. A stealthy attack in this context is an intelligent attempt to disinform a sensor network in a manner that mitigates attack discovery. In comparison with previous sensor network security studies, we explicitly model the attack scenario as an active competition between two networks where difficulties arise from the pervasive nature of the attack, the possibility of tampering during data acquisition prior to encryption, and the lack of prior knowledge regarding the characteristics of the attack We examine the problem from the perspective of both the hostile and the legitimate network. The interaction between the networks is modeled as a game where a stealth utility is derived and shown to be consistent for both players in the case of stealthy direct attacks and stealthy cross attacks. Based on the stealth utility, the optimal attack and defense strategies are obtained for each network. For the legitimate network, minimization of the attacker’s stealth results in the possibility of attack detection through established paradigms and the ability to mitigate the power of the attack. For the hostile network, maximization of the stealth utility translates into the optimal attack avoidance. This attack avoidance does not require active communication among the hostile nodes but rather relies on a level of coordination which we quantify. We demonstrate the significance and effectiveness of the solution for sensor networks acquiring scalar and multidimensional data such as surveillance sequences and relate the results to existing image sensor networks. Finally we discuss the implications of these results for achieving secure event acquisition in unattended environments. |
Sonu Shankar Parameter Assignment for Improved Connectivity and Security in Randomly Deployed Wireless Sensor Networks via Hybrid Omni/Uni-Directional Antennas () 2008. @masterthesis{ShaMSThesis08, title = {Parameter Assignment for Improved Connectivity and Security in Randomly Deployed Wireless Sensor Networks via Hybrid Omni/Uni-Directional Antennas}, author = {Sonu Shankar}, year = {2008}, date = {2008-08-01}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {Con guring a network system to operate at optimal levels of performance requires a comprehensive understanding of the e ffects of a variety of system parameters on crucial metrics like connectivity and resilience to network attacks. Traditionally, omni-directional antennas have been used for communication in wireless sensor networks. In this thesis, a hybrid communication model is presented where-in, nodes in a network are capable of both omni-directional and uni-directional communication. The eff ect of such a model on performance in randomly deployed wireless sensor networks is studied, speci cally looking at the effect of a variety of network parameters on network performance. The work in this thesis demonstrates that, when the hybrid communication model is employed, the probability of 100% connectivity improves by almost 90% and that of k-connectivity improves by almost 80% even at low node densities when compared to the traditional omni-directional model. In terms of network security, it was found that the hybrid approach improves network resilience to the collision attack by almost 85% and the cost of launching a successful network partition attack was increased by as high as 600%. The gains in connectivity and resilience were found to improve with increasing node densities and decreasing antenna beamwidths.}, type = {M.S. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {masterthesis} } Con guring a network system to operate at optimal levels of performance requires a comprehensive understanding of the e ffects of a variety of system parameters on crucial metrics like connectivity and resilience to network attacks. Traditionally, omni-directional antennas have been used for communication in wireless sensor networks. In this thesis, a hybrid communication model is presented where-in, nodes in a network are capable of both omni-directional and uni-directional communication. The eff ect of such a model on performance in randomly deployed wireless sensor networks is studied, speci cally looking at the effect of a variety of network parameters on network performance. The work in this thesis demonstrates that, when the hybrid communication model is employed, the probability of 100% connectivity improves by almost 90% and that of k-connectivity improves by almost 80% even at low node densities when compared to the traditional omni-directional model. In terms of network security, it was found that the hybrid approach improves network resilience to the collision attack by almost 85% and the cost of launching a successful network partition attack was increased by as high as 600%. The gains in connectivity and resilience were found to improve with increasing node densities and decreasing antenna beamwidths. |
A. Czarlinska; D. Kundur Reliable Event-Detection in Wireless Visual Sensor Networks through Scalar Collaboration and Game Theoretic Consideration (Journal Article) IEEE Transactions on Multimedia, 10 (5), pp. 675-690, 2008. (BibTeX | Links: ) @article{CzaKunTMM08, title = {Reliable Event-Detection in Wireless Visual Sensor Networks through Scalar Collaboration and Game Theoretic Consideration}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunTMM08.pdf http://dx.doi.org/10.1109/TMM.2008.922775}, year = {2008}, date = {2008-08-01}, journal = {IEEE Transactions on Multimedia}, volume = {10}, number = {5}, pages = {675-690}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Nebu John Mathai Cybernetic Automata: An Approach for the Realization of Economical Cognition for Multi-Robot Systems (PhD Thesis) Texas A&M University, 2008, ((Winner of TAMU 2008 U.S. Senator Phil Gramm Doctoral Award)). @phdthesis{MatPhDThesis08, title = {Cybernetic Automata: An Approach for the Realization of Economical Cognition for Multi-Robot Systems}, author = {Nebu John Mathai}, year = {2008}, date = {2008-05-01}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {(Winner of TAMU 2008 U.S. Senator Phil Gramm Doctoral Award) The multi-agent robotics paradigm has attracted much attention due to the variety of pertinent applications that are well-served by the use of a multiplicity of agents (including space robotics, search and rescue, and mobile sensor networks). The use of this paradigm for most applications, however, demands economical, lightweight agent designs for reasons of longer operational life, lower economic cost, faster and easily-verified designs, etc. An important contributing factor to an agent’s cost is its control architecture. Due to the emergence of novel implementation technologies carrying the promise of economical implementation, we consider the development of a technology-independent specification for computational machinery. To that end, the use of cybernetics toolsets (control and dynamical systems theory) is appropriate, enabling a principled specification of robotic control architectures in mathematical terms that could be mapped directly to diverse implementation substrates. This dissertation, hence, addresses the problem of developing a technologyindependent specification for lightweight control architectures to enable robotic agents to serve in a multi-agent scheme. We present the principled design of static and dynamical regulators that elicit useful behaviors, and integrate these within an overall architecture for both single and multi-agent control. Since the use of control theory can be limited in unstructured environments, a major focus of the work is on the engineering of emergent behavior. The proposed scheme is highly decentralized, requiring only local sensing and no inter-agent communication. Beyond several simulation-based studies, we provide experimental results for a two-agent system, based on a custom implementation employing field-programmable gate arrays.}, type = {Ph.D. Thesis}, note = {(Winner of TAMU 2008 U.S. Senator Phil Gramm Doctoral Award)}, keywords = {}, pubstate = {published}, tppubtype = {phdthesis} } (Winner of TAMU 2008 U.S. Senator Phil Gramm Doctoral Award) The multi-agent robotics paradigm has attracted much attention due to the variety of pertinent applications that are well-served by the use of a multiplicity of agents (including space robotics, search and rescue, and mobile sensor networks). The use of this paradigm for most applications, however, demands economical, lightweight agent designs for reasons of longer operational life, lower economic cost, faster and easily-verified designs, etc. An important contributing factor to an agent’s cost is its control architecture. Due to the emergence of novel implementation technologies carrying the promise of economical implementation, we consider the development of a technology-independent specification for computational machinery. To that end, the use of cybernetics toolsets (control and dynamical systems theory) is appropriate, enabling a principled specification of robotic control architectures in mathematical terms that could be mapped directly to diverse implementation substrates. This dissertation, hence, addresses the problem of developing a technologyindependent specification for lightweight control architectures to enable robotic agents to serve in a multi-agent scheme. We present the principled design of static and dynamical regulators that elicit useful behaviors, and integrate these within an overall architecture for both single and multi-agent control. Since the use of control theory can be limited in unstructured environments, a major focus of the work is on the engineering of emergent behavior. The proposed scheme is highly decentralized, requiring only local sensing and no inter-agent communication. Beyond several simulation-based studies, we provide experimental results for a two-agent system, based on a custom implementation employing field-programmable gate arrays. |
T. Zourntos; N. J. Mathai; S. Magierowski; D. Kundur A Bio-inspired Analog Scheme for Navigational Control of Lightweight Autonomous Agents (Inproceedings) Proc. IEEE International Conference on Robotics and Automation (ICRA), pp. 1132-1137, Pasadena, California, 2008. (BibTeX | Links: ) @inproceedings{ZouMatMagKunICRA08, title = {A Bio-inspired Analog Scheme for Navigational Control of Lightweight Autonomous Agents}, author = {T. Zourntos and N. J. Mathai and S. Magierowski and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/ZouMatMagKunICRA08.pdf http://dx.doi.org/10.1109/ROBOT.2008.4543356}, year = {2008}, date = {2008-05-01}, booktitle = {Proc. IEEE International Conference on Robotics and Automation (ICRA)}, pages = {1132-1137}, address = {Pasadena, California}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
W. Luh; D. Kundur Secure Distributed Source Coding with Side-Information (Journal Article) IEEE Communication Letters, 12 (4), pp. 310-312, 2008. (BibTeX | Links: ) @article{LuhKunICL08, title = {Secure Distributed Source Coding with Side-Information}, author = {W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunICL08.pdf http://dx.doi.org/10.1109/LCOMM.2008.080070.}, year = {2008}, date = {2008-04-01}, journal = {IEEE Communication Letters}, volume = {12}, number = {4}, pages = {310-312}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
S. Shankar; D. Kundur Towards Improved Connectivity with Hybrid Uni/Omni-Directional Antennas in Wireless Sensor Networks (Inproceedings) Proc. IEEE INFOCOM Workshops, pp. 1-4, Phoenix, Arizona, 2008. (BibTeX | Links: ) @inproceedings{ShaKunINFOCOM08, title = {Towards Improved Connectivity with Hybrid Uni/Omni-Directional Antennas in Wireless Sensor Networks}, author = {S. Shankar and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/ShaKunINFOCOM08.pdf http://dx.doi.org/10.1109/INFOCOM.2008.4544587}, year = {2008}, date = {2008-04-01}, booktitle = {Proc. IEEE INFOCOM Workshops}, pages = {1-4}, address = {Phoenix, Arizona}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; W. Luh; D. Kundur G-E-M Sensor Networks for Mission Critical Surveillance in Hostile Environments Sensor Networks for Mission Critical Surveillance in Hostile Environments (Inproceedings) Proc. IEEE INFOCOM Workshop on Mission Critical Networks, pp. 1-6, Phoenix, Arizona, 2008. (BibTeX | Links: ) @inproceedings{CzaLuhKunMCN08, title = {G-E-M Sensor Networks for Mission Critical Surveillance in Hostile Environments Sensor Networks for Mission Critical Surveillance in Hostile Environments}, author = {A. Czarlinska and W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaLuhKunMCN08.pdf http://dx.doi.org/10.1109/INFOCOM.2008.4544592}, year = {2008}, date = {2008-04-01}, booktitle = {Proc. IEEE INFOCOM Workshop on Mission Critical Networks}, pages = {1-6}, address = {Phoenix, Arizona}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
U. N. Okorafor; D. Kundur A Secure Integrated Routing and Localization Scheme for Broadband Mission Critical Networks (Inproceedings) Proc. IEEE INFOCOM Workshop on Mission Critical Networks, pp. 1-6, Phoenix, Arizona, 2008, (Best paper award finalist.). (BibTeX | Links: ) @inproceedings{OkoKunMCN08a, title = {A Secure Integrated Routing and Localization Scheme for Broadband Mission Critical Networks}, author = {U. N. Okorafor and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/OkoKunMCN08.pdf http://dx.doi.org/10.1109/INFOCOM.2008.4544580}, year = {2008}, date = {2008-04-01}, booktitle = {Proc. IEEE INFOCOM Workshop on Mission Critical Networks}, pages = {1-6}, address = {Phoenix, Arizona}, note = {Best paper award finalist.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; D. Kundur Coordination and Selfishness in Attacks on Visual Sensor Networks (Inproceedings) Proc. IEEE Wireless Communications & Networking Conference (WCNC), pp. 2391-2396, Las Vegas, Nevada, 2008. (BibTeX | Links: ) @inproceedings{CzaKunWCNC08, title = {Coordination and Selfishness in Attacks on Visual Sensor Networks}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunWCNC08.pdf http://dx.doi.org/10.1109/WCNC.2008.421}, year = {2008}, date = {2008-03-01}, booktitle = {Proc. IEEE Wireless Communications & Networking Conference (WCNC)}, pages = {2391-2396}, address = {Las Vegas, Nevada}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
N. J. Mathai; T. Zourntos; D. Kundur Vector Field Design of Screw-Type Chaos (Journal Article) Fluctuations and Noise Letters, 8 (3-4), pp. L369-L379, 2008. (BibTeX | Links: ) @article{MatZouKunFNL08, title = {Vector Field Design of Screw-Type Chaos}, author = {N. J. Mathai and T. Zourntos and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/MatZouKunFNL08.pdf http://dx.doi.org/10.1142/S0219477508005045}, year = {2008}, date = {2008-01-01}, journal = {Fluctuations and Noise Letters}, volume = {8}, number = {3-4}, pages = {L369-L379}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
A. Czarlinska; D. Kundur Reliable Scalar-Visual Event-Detection in Wireless Visual Sensor Networks (Inproceedings) Proc. IEEE Consumer Communications & Networking Conference (CCNC) Special Session on Image/Video Processing & Wireless Sensor Networks, pp. 660-664, Las Vegas, Nevada, 2008. (BibTeX | Links: ) @inproceedings{CzaKunCCNC08, title = {Reliable Scalar-Visual Event-Detection in Wireless Visual Sensor Networks}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunCCNC08.pdf http://dx.doi.org/10.1109/ccnc08.2007.152}, year = {2008}, date = {2008-01-01}, booktitle = {Proc. IEEE Consumer Communications & Networking Conference (CCNC) Special Session on Image/Video Processing & Wireless Sensor Networks}, pages = {660-664}, address = {Las Vegas, Nevada}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; D. Kundur Event-Driven Visual Sensor Networks: Issues in Reliability (Inproceedings) Proc. IEEE Workshop on Applications of Computer Vision (WACV), pp. 1-6, Copper Mountain Resort, 2008. (BibTeX | Links: ) @inproceedings{CzaKunWACV08, title = {Event-Driven Visual Sensor Networks: Issues in Reliability}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunWACV08.pdf http://dx.doi.org/10.1109/WACV.2008.4544039}, year = {2008}, date = {2008-01-01}, booktitle = {Proc. IEEE Workshop on Applications of Computer Vision (WACV)}, pages = {1-6}, address = {Copper Mountain Resort}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
D. Kundur; W. Luh; U. N. Okorafor; T. Zourntos Security and Privacy for Distributed Multimedia Sensor Networks (Journal Article) Proceedings of the IEEE Special Issue on Recent Advances in Distributed Multimedia Communications, 96 (1), pp. 112-130, 2008. (BibTeX | Links: ) @article{KunLuhOkoZouProcIEEE08, title = {Security and Privacy for Distributed Multimedia Sensor Networks}, author = {D. Kundur and W. Luh and U. N. Okorafor and T. Zourntos}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/KunLuhOkoZouProcIEEE08.pdf http://dx.doi.org/10.1109/JPROC.2007.909914}, year = {2008}, date = {2008-01-01}, journal = {Proceedings of the IEEE Special Issue on Recent Advances in Distributed Multimedia Communications}, volume = {96}, number = {1}, pages = {112-130}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
2007 |
W. Luh; D. Kundur Separate Enciphering of Correlated Messages for Confidentiality in Distributed Networks (Inproceedings) Proc. IEEE Global Communications Conference (GLOBECOM), pp. 1637-1641, Washington, DC, 2007. (BibTeX | Links: ) @inproceedings{LuhKunGLOBECOM07b, title = {Separate Enciphering of Correlated Messages for Confidentiality in Distributed Networks}, author = {W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunGLOBECOM07b.pdf http://dx.doi.org/10.1109/GLOCOM.2007.315}, year = {2007}, date = {2007-11-01}, booktitle = {Proc. IEEE Global Communications Conference (GLOBECOM)}, pages = {1637-1641}, address = {Washington, DC}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
W. Luh; D. Kundur Distributed Keyless Secret Sharing over Noiseless Channels (Inproceedings) Proc. IEEE Global Communications Conference (GLOBECOM), pp. 44-48, Washington, DC, 2007. (BibTeX | Links: ) @inproceedings{LuhKunGLOBECOM07a, title = {Distributed Keyless Secret Sharing over Noiseless Channels}, author = {W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunGLOBECOM07a.pdf Distributed Keyless Secret Sharing over Noiseless Channels}, year = {2007}, date = {2007-11-01}, booktitle = {Proc. IEEE Global Communications Conference (GLOBECOM)}, pages = {44-48}, address = {Washington, DC}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; W. Luh; D. Kundur Attacks on Sensing in Hostile Sensor-Actuator Environments (Inproceedings) Proc. IEEE Global Communications Conference (GLOBECOM), pp. 1001-1005, Washington, DC, 2007. (BibTeX | Links: ) @inproceedings{CzaLuhKunGLOBECOM07, title = {Attacks on Sensing in Hostile Sensor-Actuator Environments}, author = {A. Czarlinska and W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaLuhKunGLOBECOM07.pdf http://dx.doi.org/10.1109/GLOCOM.2007.193}, year = {2007}, date = {2007-11-01}, booktitle = {Proc. IEEE Global Communications Conference (GLOBECOM)}, pages = {1001-1005}, address = {Washington, DC}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
J. S. Jainsky; D. Kundur; D. R. Halverson Towards Digital Video Steganalysis using Asymptotic Memoryless Detection (Inproceedings) Proc. ACM Multimedia and Security (MMSec) Workshop, pp. 161-168, Dallas, Texas, 2007. (BibTeX | Links: ) @inproceedings{JaiKunHalMMSec07, title = {Towards Digital Video Steganalysis using Asymptotic Memoryless Detection}, author = {J. S. Jainsky and D. Kundur and D. R. Halverson}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/JaiKunHalMMSec07.pdf http://doi.acm.org/10.1145/1288869.1288891}, year = {2007}, date = {2007-09-01}, booktitle = {Proc. ACM Multimedia and Security (MMSec) Workshop}, pages = {161-168}, address = {Dallas, Texas}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; D. Kundur Attack vs. Failure Detection in Event-Driven Wireless Visual Sensor Networks (Inproceedings) Proc. ACM Multimedia and Security (MMSec) Workshop, pp. 215-220, Dallas, Texas, 2007. (BibTeX | Links: ) @inproceedings{CzaKunMMSec07b, title = {Attack vs. Failure Detection in Event-Driven Wireless Visual Sensor Networks}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunMMSec07.pdf http://doi.acm.org/10.1145/1288869.1288899}, year = {2007}, date = {2007-09-01}, booktitle = {Proc. ACM Multimedia and Security (MMSec) Workshop}, pages = {215-220}, address = {Dallas, Texas}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
W. Luh; D. Kundur Distributed Keyless Security for Correlated Data with Applications in Visual Sensor Networks (Inproceedings) Proc. ACM Multimedia and Security (MMSec) Workshop, pp. 75-86, Dallas, Texas, 2007. (BibTeX | Links: ) @inproceedings{LuhKunMMSec07, title = {Distributed Keyless Security for Correlated Data with Applications in Visual Sensor Networks}, author = {W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunMMSec07.pdf http://doi.acm.org/10.1145/1288869.1288881}, year = {2007}, date = {2007-09-01}, booktitle = {Proc. ACM Multimedia and Security (MMSec) Workshop}, pages = {75-86}, address = {Dallas, Texas}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; D. Kundur Towards Characterizing the Effectiveness of Random Mobility Against Actuation Attacks (Journal Article) Journal of Computer Communications Special Issue on Sensor and Actuator Networks, 30 (13), pp. 2546-2558, 2007. (BibTeX | Links: ) @article{CzaKunJCC07, title = {Towards Characterizing the Effectiveness of Random Mobility Against Actuation Attacks}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunJCC07.pdf http://dx.doi.org/10.1016/j.comcom.2007.05.030}, year = {2007}, date = {2007-09-01}, journal = {Journal of Computer Communications Special Issue on Sensor and Actuator Networks}, volume = {30}, number = {13}, pages = {2546-2558}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
D. Kundur; Z. Liu; M. Merabti; H.H. Yu Advances in Peer-to-Peer Content Search (Inproceedings) Proc. IEEE International Conference on Mulitmedia and Expo (ICME), pp. 404-407, Beijing, China, 2007. (BibTeX | Links: ) @inproceedings{KunLiuMerYuICME07, title = {Advances in Peer-to-Peer Content Search}, author = {D. Kundur and Z. Liu and M. Merabti and H.H. Yu}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/KunLiuMerYuICME07.pdf http://dx.doi.org/10.1109/ICME.2007.4284672}, year = {2007}, date = {2007-07-01}, booktitle = {Proc. IEEE International Conference on Mulitmedia and Expo (ICME)}, pages = {404-407}, address = {Beijing, China}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
D. Kundur; U. N. Okorafor On the Connectivity of Hierarchical Directional Optical Sensor Networks (Inproceedings) Proc. IEEE Wireless Communications & Networking Conference (WCNC), pp. 11-15, Hong Kong, 2007. (BibTeX | Links: ) @inproceedings{OkoKunWCNC07b, title = {On the Connectivity of Hierarchical Directional Optical Sensor Networks}, author = {D. Kundur and U. N. Okorafor}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/OkoKunWCNC07.pdf http://dx.doi.org/10.1109/WCNC.2007.646}, year = {2007}, date = {2007-03-01}, booktitle = {Proc. IEEE Wireless Communications & Networking Conference (WCNC)}, pages = {11-15}, address = {Hong Kong}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
U. N. Okorafor; D. Kundur On Node Isolation in Directional Sensor Networks (Inproceedings) Proc. ACM Conference on Embedded Networked Sensor Systems (SenSys), pp. 433-434, Syndney, Australia, 2007. (BibTeX | Links: ) @inproceedings{OkoKunSenSys07, title = {On Node Isolation in Directional Sensor Networks}, author = {U. N. Okorafor and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/OkoKunSenSys07.pdf http://dx.doi.org/10.1109/WCNC.2007.646}, year = {2007}, date = {2007-03-01}, booktitle = {Proc. ACM Conference on Embedded Networked Sensor Systems (SenSys)}, pages = {433-434}, address = {Syndney, Australia}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
D. Kundur; C.-Y. Lin; C.-S. Lu Visual Sensor Networks (Journal Article) EURASIP Journal on Advances in Signal Processing, 2007 , pp. Article ID 21515, 3 pages, 2007. (BibTeX | Links: ) @article{KunLinLuJASP07, title = {Visual Sensor Networks}, author = {D. Kundur and C.-Y. Lin and C.-S. Lu}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/KunLinLuJASP07.pdf http://dx.doi.org/10.1155/2007/21515}, year = {2007}, date = {2007-01-17}, journal = {EURASIP Journal on Advances in Signal Processing}, volume = {2007}, pages = {Article ID 21515, 3 pages}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
W. Luh; D. Kundur; T. Zourntos A Novel Distributed Privacy Paradigm for Visual Sensor Networks Based on Sharing Dynamical Systems (Journal Article) EURASIP Journal on Advances in Signal Processing Signal Processing, 2007 (Article ID 21646), pp. 17 pages, 2007. (BibTeX | Links: ) @article{LuhKunZouJASP07, title = {A Novel Distributed Privacy Paradigm for Visual Sensor Networks Based on Sharing Dynamical Systems}, author = {W. Luh and D. Kundur and T. Zourntos}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunZouJASP07.pdf http://dx.doi.org/10.1155/2007/21646}, year = {2007}, date = {2007-01-01}, journal = {EURASIP Journal on Advances in Signal Processing Signal Processing}, volume = {2007}, number = {Article ID 21646}, pages = {17 pages}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
2006 |
W. Luh; D. Kundur "Multimedia Fingerprinting, " in Encyclopedia of Multimedia (Book Chapter) B. Furht (Ed.): Springer, 2006, ISBN: 978-0-387-74724-8. (BibTeX | Links: ) @inbook{LuhKunEncyMM05, title = {\"Multimedia Fingerprinting, \" in Encyclopedia of Multimedia}, author = {W. Luh and D. Kundur}, editor = {B. Furht}, url = {http://www.springer.com/computer/information+systems+and+applications/book/978-0-387-74724-8}, isbn = {978-0-387-74724-8}, year = {2006}, date = {2006-12-20}, publisher = {Springer}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } |
D. Kundur; W. Luh "Multimedia Sensor Networks," in Encyclopedia of Multimedia (Book Chapter) B. Furht (Ed.): Springer, 2006, ISBN: 978-0-387-74724-8. (BibTeX | Links: ) @inbook{KunLuhEncyMM05, title = {\"Multimedia Sensor Networks,\" in Encyclopedia of Multimedia}, author = {D. Kundur and W. Luh}, editor = {B. Furht}, url = {http://www.springer.com/computer/information+systems+and+applications/book/978-0-387-74724-8}, isbn = {978-0-387-74724-8}, year = {2006}, date = {2006-12-20}, publisher = {Springer}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } |
D. Kundur; W. Luh; U. N. Okorafor HoLiSTiC: Heterogeneous Lightweight Sensornets for Trusted Visual Computing (Inproceedings) Proc. IEEE Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP), pp. 267-270, Pasadenia, California, 2006. (BibTeX | Links: ) @inproceedings{KunLuhOkoIIHMSP06, title = {HoLiSTiC: Heterogeneous Lightweight Sensornets for Trusted Visual Computing}, author = {D. Kundur and W. Luh and U. N. Okorafor}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/KunLuhOkoIIHMSP06.pdf http://dx.doi.org/10.1109/IIH-MSP.2006.109}, year = {2006}, date = {2006-12-01}, booktitle = {Proc. IEEE Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)}, pages = {267-270}, address = {Pasadenia, California}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
U. Budhia; D. Kundur; T. Zourntos Digital Video Steganalysis Exploiting Statistical Visibility in the Temporal Domain (Journal Article) IEEE Transactions on Information Forensics and Security, 1 (4), pp. 502-516, 2006. (BibTeX | Links: ) @article{BudKunZouTIFS06, title = {Digital Video Steganalysis Exploiting Statistical Visibility in the Temporal Domain}, author = {U. Budhia and D. Kundur and T. Zourntos}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/BudKunZouTIFS06.pdf http://dx.doi.org/10.1109/TIFS.2006.885020}, year = {2006}, date = {2006-12-01}, journal = {IEEE Transactions on Information Forensics and Security}, volume = {1}, number = {4}, pages = {502-516}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
U. N. Okorafor; K. Marshall; D. Kundur Security and Energy Considerations for Routing in Hierarchical Optical Sensor Networks (Inproceedings) Proc. IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 888-893, Vancouver, Canada, 2006. (BibTeX | Links: ) @inproceedings{OkoMarKunMASS06, title = {Security and Energy Considerations for Routing in Hierarchical Optical Sensor Networks}, author = {U. N. Okorafor and K. Marshall and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/OkoMarKunMASS06.pdf http://dx.doi.org/10.1109/MOBHOC.2006.278670}, year = {2006}, date = {2006-10-01}, booktitle = {Proc. IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS)}, pages = {888-893}, address = {Vancouver, Canada}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
U. N. Okorafor; D. Kundur OPSENET: A Security Enabled Routing Scheme for a System of Optical Sensor Networks (Inproceedings) Proc. International Conference on Broadband Communications, Networks, and Systems (BROADNETS), pp. 1-10, San Jose, California, 2006. (BibTeX | Links: ) @inproceedings{OkoKunBROADNETS06, title = {OPSENET: A Security Enabled Routing Scheme for a System of Optical Sensor Networks}, author = {U. N. Okorafor and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/OkoKunBROADNETS06.pdf http://dx.doi.org/10.1109/BROADNETS.2006.4374297}, year = {2006}, date = {2006-10-01}, booktitle = {Proc. International Conference on Broadband Communications, Networks, and Systems (BROADNETS)}, pages = {1-10}, address = {San Jose, California}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Z. Liu; H.H. Yu; D. Kundur; M. Merabti On Peer-to-Peer Multimedia Content Access and Distribution (Inproceedings) Proc. IEEE International Conference on Mulitmedia and Expo (ICME), pp. 557-560, Toronto, Canada, 2006. (BibTeX | Links: ) @inproceedings{LiuYuKunMerICME06, title = {On Peer-to-Peer Multimedia Content Access and Distribution}, author = {Z. Liu and H.H. Yu and D. Kundur and M. Merabti}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LiuYuKunMerICME06.pdf http://dx.doi.org/10.1109/ICME.2006.262469}, year = {2006}, date = {2006-07-01}, booktitle = {Proc. IEEE International Conference on Mulitmedia and Expo (ICME)}, pages = {557-560}, address = {Toronto, Canada}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Anli Chen Encrypted Media Aggregation in Wireless Sensor Networks () 2006. @masterthesis{CheMERep08, title = {Encrypted Media Aggregation in Wireless Sensor Networks}, author = {Anli Chen}, year = {2006}, date = {2006-05-09}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {In historical investigation, sensors devices typically measure simple things such as humility, temperature, or pressure. This results in a fairly limited amount of data generated, even over thousands of sensors. Now, if we look ten years into the future when video capture devices will most likely be small and inexpensive, the ability to create video-based sensor networks will be possible. Previous literature has demonstrated the necessity of in-network data aggregation in order to minimize the volume of messages exchanged in the hierarchical wireless sensor networks. Nevertheless, with the severe power constraints, sensor networks are much more vulnerable to all those threats. A portion of the sensor devices may be physically captured by attackers, or even worse, the crucial elements like cluster heads and aggregators may also stimulate malicious intrusion. Sensor networks are more vulnerable than traditional communication and computation systems to security threats because of their severe power constraints. Furthermore, since crucial elements such as cluster heads and aggregators in sensor networks can often contain information of higher security level, they are more attractive to the attackers and may stimulate more malicious intrusion. Our primary objective is to develop a sufficiently secure, efficient, adaptive, and resilient mechanism for media aggregation within wireless sensor networks. After substantial investigation, we assert that one effective way to balance security with resource limitations for secure aggregation is to employ aggregation functions with the homomorphic attribute. This essentially means that aggregation can occur directly on ciphertext (i.e. encrypted media) opposed to plaintext (i.e. raw unencrypted data). We propose to adopt Statistical Disclosure Control (SDC), Secure Multiparty Computation (SMC) and Discrete Wavelet Transform (DWT) techniques to boost secure aggregation. We tailor the three methods into wireless sensor network scenario so that encrypted media can be securely aggregated. The result of this study allows the network administrator to adaptively select the most appropriate securing method that assures adequate protection according to their practical needs and environmental condition.}, type = {M.E. Report}, keywords = {}, pubstate = {published}, tppubtype = {masterthesis} } In historical investigation, sensors devices typically measure simple things such as humility, temperature, or pressure. This results in a fairly limited amount of data generated, even over thousands of sensors. Now, if we look ten years into the future when video capture devices will most likely be small and inexpensive, the ability to create video-based sensor networks will be possible. Previous literature has demonstrated the necessity of in-network data aggregation in order to minimize the volume of messages exchanged in the hierarchical wireless sensor networks. Nevertheless, with the severe power constraints, sensor networks are much more vulnerable to all those threats. A portion of the sensor devices may be physically captured by attackers, or even worse, the crucial elements like cluster heads and aggregators may also stimulate malicious intrusion. Sensor networks are more vulnerable than traditional communication and computation systems to security threats because of their severe power constraints. Furthermore, since crucial elements such as cluster heads and aggregators in sensor networks can often contain information of higher security level, they are more attractive to the attackers and may stimulate more malicious intrusion. Our primary objective is to develop a sufficiently secure, efficient, adaptive, and resilient mechanism for media aggregation within wireless sensor networks. After substantial investigation, we assert that one effective way to balance security with resource limitations for secure aggregation is to employ aggregation functions with the homomorphic attribute. This essentially means that aggregation can occur directly on ciphertext (i.e. encrypted media) opposed to plaintext (i.e. raw unencrypted data). We propose to adopt Statistical Disclosure Control (SDC), Secure Multiparty Computation (SMC) and Discrete Wavelet Transform (DWT) techniques to boost secure aggregation. We tailor the three methods into wireless sensor network scenario so that encrypted media can be securely aggregated. The result of this study allows the network administrator to adaptively select the most appropriate securing method that assures adequate protection according to their practical needs and environmental condition. |
W. Luh; D. Kundur Distributed Privacy for Visual Sensor Networks via Markov Shares (Inproceedings) Proc. 2nd IEEE Workshop on Dependability and Security in Sensor Networks and Systems (DSSNS), pp. 23-34, Columbia, Maryland, 2006. (BibTeX | Links: ) @inproceedings{LuhKunDSSNS06, title = {Distributed Privacy for Visual Sensor Networks via Markov Shares}, author = {W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunDSSNS06.pdf http://dx.doi.org/10.1109/DSSNS.2006.5}, year = {2006}, date = {2006-04-01}, booktitle = {Proc. 2nd IEEE Workshop on Dependability and Security in Sensor Networks and Systems (DSSNS)}, pages = {23-34}, address = {Columbia, Maryland}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
A. Czarlinska; D. Kundur Distributed Actuation Attacks in Wireless Sensor Networks: Implications and Countermeasures (Inproceedings) Proc. 2nd IEEE Workshop on Dependability and Security in Sensor Networks and Systems (DSSNS), pp. 3-12, Columbia, Maryland, 2006. (BibTeX | Links: ) @inproceedings{CzaKunDSSNS06, title = {Distributed Actuation Attacks in Wireless Sensor Networks: Implications and Countermeasures}, author = {A. Czarlinska and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/CzaKunDSSNS06.pdf http://dx.doi.org/10.1109/DSSNS.2006.4}, year = {2006}, date = {2006-04-01}, booktitle = {Proc. 2nd IEEE Workshop on Dependability and Security in Sensor Networks and Systems (DSSNS)}, pages = {3-12}, address = {Columbia, Maryland}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
C. Fei; D. Kundur; R. Kwong Analysis and Design of Secure Watermark-based Authentication Systems (Journal Article) IEEE Transactions on Information Forensics and Security, 1 (1), pp. 43-55, 2006. (BibTeX | Links: ) @article{FeiKunKwoTIFS06, title = {Analysis and Design of Secure Watermark-based Authentication Systems}, author = {C. Fei and D. Kundur and R. Kwong}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/FeiKunKwoTIFS06.pdf http://dx.doi.org/10.1109/TIFS.2005.863505}, year = {2006}, date = {2006-03-01}, journal = {IEEE Transactions on Information Forensics and Security}, volume = {1}, number = {1}, pages = {43-55}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Chuhong Fei Analysis and Design of Watermark-Based Multimedia Authentication Systems (PhD Thesis) University of Toronto, 2006. @phdthesis{FeiPhDThesis08, title = {Analysis and Design of Watermark-Based Multimedia Authentication Systems}, author = {Chuhong Fei}, year = {2006}, date = {2006-01-01}, address = {Toronto, Canada}, school = {University of Toronto}, abstract = {Multimedia authentication techniques are required to protect the integrity and origin of digital multimedia data. In watermark-based multimedia authentication systems, a source-dependent authenticator is invisibly embedded within the protected data itself, in order to alert unacceptable distortions on the data and to authenticate the legitimate source. This thesis investigates the design and analysis of such systems. We formulate the authentication problem as error detection coding with robustness to certain types of legitimate channel noise. System performance requirements such as semi-fragility, security, key payload, embedding distortion, and algorithm complexity are all investigated in the unified framework to obtain best tradeoffs among them.In the analysis of multimedia authentication systems, we demonstrate how lattice codes can be used to address semi-fragile requirements and embedding distortion in a practical scheme. Security against possible malicious attacks is considered at the code level, and cryptographic techniques are incorporated to construct secure codes. We propose a novel security enhancement strategy based on nested lattice codes that results in secure and efficient authentication algorithms. Unconditional security is also investigated. We provide a formal methodology using composite hypothesis testing to balance robustness and fragility objectives with respect to legitimate and illegitimate distortions that is superior to existing approaches. We show that a quantization-based watermarking scheme is more appropriate for achieving semi-fragility.In system design, we propose two practical watermark-based authentication schemes for natural images: one for uncompressed images, the other for JPEG compressed ones. Our proposed algorithms are able to distinguish incidental distortions, such as JPEG compression and image enhancement filtering, from malicious tampering such as image object removal and substitution even in a small portion of the protected images. Our algorithms are secure against an active attacker, and are able to determine the degree of distortion and its location. In addition, our proposed joint compression and authentication scheme for compressed images is able to increase compression efficiency while keeping practical robustness to mild incidental signal processing changes. Effectiveness of the proposed algorithms is demonstrated by simulations and comparison with existing schemes. In the analysis of multimedia authentication systems, we demonstrate how lattice codes can be used to address semi-fragile requirements and embedding distortion in a practical scheme. Security against possible malicious attacks is considered at the code level, and cryptographic techniques are incorporated to construct secure codes. We propose a novel security enhancement strategy based on nested lattice codes that results in secure and efficient authentication algorithms. Unconditional security is also investigated. We provide a formal methodology using composite hypothesis testing to balance robustness and fragility objectives with respect to legitimate and illegitimate distortions that is superior to existing approaches. We show that a quantization-based watermarking scheme is more appropriate for achieving semi-fragility. In system design, we propose two practical watermark-based authentication schemes for natural images: one for uncompressed images, the other for JPEG compressed ones. Our proposed algorithms are able to distinguish incidental distortions, such as JPEG compression and image enhancement filtering, from malicious tampering such as image object removal and substitution even in a small portion of the protected images. Our algorithms are secure against an active attacker, and are able to determine the degree of distortion and its location. In addition, our proposed joint compression and authentication scheme for compressed images is able to increase compression efficiency while keeping practical robustness to mild incidental signal processing changes. Effectiveness of the proposed algorithms is demonstrated by simulations and comparison with existing schemes. }, type = {Ph.D. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {phdthesis} } Multimedia authentication techniques are required to protect the integrity and origin of digital multimedia data. In watermark-based multimedia authentication systems, a source-dependent authenticator is invisibly embedded within the protected data itself, in order to alert unacceptable distortions on the data and to authenticate the legitimate source. This thesis investigates the design and analysis of such systems. We formulate the authentication problem as error detection coding with robustness to certain types of legitimate channel noise. System performance requirements such as semi-fragility, security, key payload, embedding distortion, and algorithm complexity are all investigated in the unified framework to obtain best tradeoffs among them.In the analysis of multimedia authentication systems, we demonstrate how lattice codes can be used to address semi-fragile requirements and embedding distortion in a practical scheme. Security against possible malicious attacks is considered at the code level, and cryptographic techniques are incorporated to construct secure codes. We propose a novel security enhancement strategy based on nested lattice codes that results in secure and efficient authentication algorithms. Unconditional security is also investigated. We provide a formal methodology using composite hypothesis testing to balance robustness and fragility objectives with respect to legitimate and illegitimate distortions that is superior to existing approaches. We show that a quantization-based watermarking scheme is more appropriate for achieving semi-fragility.In system design, we propose two practical watermark-based authentication schemes for natural images: one for uncompressed images, the other for JPEG compressed ones. Our proposed algorithms are able to distinguish incidental distortions, such as JPEG compression and image enhancement filtering, from malicious tampering such as image object removal and substitution even in a small portion of the protected images. Our algorithms are secure against an active attacker, and are able to determine the degree of distortion and its location. In addition, our proposed joint compression and authentication scheme for compressed images is able to increase compression efficiency while keeping practical robustness to mild incidental signal processing changes. Effectiveness of the proposed algorithms is demonstrated by simulations and comparison with existing schemes. In the analysis of multimedia authentication systems, we demonstrate how lattice codes can be used to address semi-fragile requirements and embedding distortion in a practical scheme. Security against possible malicious attacks is considered at the code level, and cryptographic techniques are incorporated to construct secure codes. We propose a novel security enhancement strategy based on nested lattice codes that results in secure and efficient authentication algorithms. Unconditional security is also investigated. We provide a formal methodology using composite hypothesis testing to balance robustness and fragility objectives with respect to legitimate and illegitimate distortions that is superior to existing approaches. We show that a quantization-based watermarking scheme is more appropriate for achieving semi-fragility. In system design, we propose two practical watermark-based authentication schemes for natural images: one for uncompressed images, the other for JPEG compressed ones. Our proposed algorithms are able to distinguish incidental distortions, such as JPEG compression and image enhancement filtering, from malicious tampering such as image object removal and substitution even in a small portion of the protected images. Our algorithms are secure against an active attacker, and are able to determine the degree of distortion and its location. In addition, our proposed joint compression and authentication scheme for compressed images is able to increase compression efficiency while keeping practical robustness to mild incidental signal processing changes. Effectiveness of the proposed algorithms is demonstrated by simulations and comparison with existing schemes. |
C. Fei; D. Kundur; R. Kwong A Hypothesis Testing Approach for Achieving Semi-fragility in Multimedia Authentication (Inproceedings) E. J. Delp III; P. W. Wong (Ed.): Proc. SPIE Security and Watermarking of Multimedia Contents VIII, pp. 607220-1 - 607220-12, San Jose, California, 2006. (BibTeX | Links: ) @inproceedings{FeiKunKwoSPIE06, title = {A Hypothesis Testing Approach for Achieving Semi-fragility in Multimedia Authentication}, author = {C. Fei and D. Kundur and R. Kwong}, editor = {E. J. Delp III and P. W. Wong}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/FeiKunKwoSPIE06.pdf http://dx.doi.org/10.1117/12.643502}, year = {2006}, date = {2006-01-01}, booktitle = {Proc. SPIE Security and Watermarking of Multimedia Contents VIII}, volume = {6072}, pages = {607220-1 - 607220-12}, address = {San Jose, California}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2005 |
U. N. Okorafor; D. Kundur Efficient Routing Protocols for a Free Space Optical Sensor Network (Inproceedings) Proc. IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS), pp. 251-258, Washington, DC, 2005. (BibTeX | Links: ) @inproceedings{OkoKunMASS05, title = {Efficient Routing Protocols for a Free Space Optical Sensor Network}, author = {U. N. Okorafor and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/OkoKunMASS05.pdf http://dx.doi.org/10.1109/MAHSS.2005.1542807}, year = {2005}, date = {2005-11-01}, booktitle = {Proc. IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS)}, pages = {251-258}, address = {Washington, DC}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
W. Luh; D. Kundur New Paradigms for Effective Broadcasting and Fingerprinting of Entertainment Media (Journal Article) IEEE Communications Magazine, 43 (6), pp. 77-84, 2005. (BibTeX | Links: ) @article{LuhKunICM05, title = {New Paradigms for Effective Broadcasting and Fingerprinting of Entertainment Media}, author = {W. Luh and D. Kundur}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/LuhKunICM05.pdf http://dx.doi.org/10.1109/MCOM.2005.1452834}, year = {2005}, date = {2005-06-01}, journal = {IEEE Communications Magazine}, volume = {43}, number = {6}, pages = {77-84}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Udit Budhia Steganalysis of Video Sequences using Collusion Sensitivity () 2005. @masterthesis{BudMSThesis05, title = {Steganalysis of Video Sequences using Collusion Sensitivity}, author = {Udit Budhia}, year = {2005}, date = {2005-05-01}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {In this thesis we present an effective steganalysis technique for digital video sequences based on the collusion attack. Steganalysis is the process of detecting with a high probability the presence of covert data in multimedia. Existing algorithms for steganalysis target detecting covert information in still images. When applied directly to video sequences these approaches are suboptimal. In this thesis we present methods that overcome this limitation by using redundant information present in the temporal domain to detect covert messages in the form of Gaussian watermarks. In particular we target the spread spectrum steganography method because of its widespread use. Our gains are achieved by exploiting the collusion attack that has recently been studied in the field of digital video watermarking and more sophisticated pattern recognition tools. Through analysis and simulations we, evaluate the effectiveness of the video steganalysis method based on averaging based collusion scheme. Other forms of collusion attack in the form of weighted linear collusion and block-based collusion schemes have been proposed to improve the detection performance. The proposed steganalsyis methods were successful in detecting hidden watermarks bearing low SNR with high accuracy. The simulation results also show the improved performance of the proposed temporal based methods over the spatial methods. We conclude that the essence of future video steganalysis techniques lies in the exploitation of the temporal redundancy.}, type = {M.S. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {masterthesis} } In this thesis we present an effective steganalysis technique for digital video sequences based on the collusion attack. Steganalysis is the process of detecting with a high probability the presence of covert data in multimedia. Existing algorithms for steganalysis target detecting covert information in still images. When applied directly to video sequences these approaches are suboptimal. In this thesis we present methods that overcome this limitation by using redundant information present in the temporal domain to detect covert messages in the form of Gaussian watermarks. In particular we target the spread spectrum steganography method because of its widespread use. Our gains are achieved by exploiting the collusion attack that has recently been studied in the field of digital video watermarking and more sophisticated pattern recognition tools. Through analysis and simulations we, evaluate the effectiveness of the video steganalysis method based on averaging based collusion scheme. Other forms of collusion attack in the form of weighted linear collusion and block-based collusion schemes have been proposed to improve the detection performance. The proposed steganalsyis methods were successful in detecting hidden watermarks bearing low SNR with high accuracy. The simulation results also show the improved performance of the proposed temporal based methods over the spatial methods. We conclude that the essence of future video steganalysis techniques lies in the exploitation of the temporal redundancy. |
K. Su; D. Kundur; D. Hatzinakos Spatially Localized Image-dependent Watermarking for Statistical Invisibility and Collusion (Journal Article) IEEE Transactions on Multimedia, 7 (1), pp. 52-66, 2005. (BibTeX | Links: ) @article{SuKunHatTMM05b, title = {Spatially Localized Image-dependent Watermarking for Statistical Invisibility and Collusion}, author = {K. Su and D. Kundur and D. Hatzinakos}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/SuKunHatTMM05b.pdf http://dx.doi.org/10.1109/TMM.2004.840614}, year = {2005}, date = {2005-02-01}, journal = {IEEE Transactions on Multimedia}, volume = {7}, number = {1}, pages = {52-66}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
K. Su; D. Kundur; D. Hatzinakos Statistical Invisibility for Collusion-resistant Digital Video Watermarking (Journal Article) IEEE Transactions on Multimedia, 7 (1), pp. 43-51, 2005. (BibTeX | Links: ) @article{SuKunHatTMM05, title = {Statistical Invisibility for Collusion-resistant Digital Video Watermarking}, author = {K. Su and D. Kundur and D. Hatzinakos}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/SuKunHatTMM05.pdf http://dx.doi.org/10.1109/TMM.2004.840617}, year = {2005}, date = {2005-02-01}, journal = {IEEE Transactions on Multimedia}, volume = {7}, number = {1}, pages = {43-51}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
C. Fei; D. Kundur; R. Kwong Achieving Computational and Unconditional Security in Authentication Watermarking: Analysis, Insights, and Algorithms (Inproceedings) E. J. Delp III; P. W. Wong (Ed.): Proc. SPIE Security and Watermarking of Multimedia Contents VII, pp. 697-708, San Jose, California, 2005. (BibTeX | Links: ) @inproceedings{FeiKunKwoSPIE05, title = {Achieving Computational and Unconditional Security in Authentication Watermarking: Analysis, Insights, and Algorithms}, author = {C. Fei and D. Kundur and R. Kwong}, editor = {E. J. Delp III and P. W. Wong}, url = {http://www.comm.utoronto.ca/~dkundur/pub_pdfs/FeiKunKwoSPIE05.pdf http://dx.doi.org/10.1117/12.586388}, year = {2005}, date = {2005-01-01}, booktitle = {Proc. SPIE Security and Watermarking of Multimedia Contents VII}, volume = {5681}, number = {5681}, pages = {697-708}, address = {San Jose, California}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2004 |
W. Luh; D. Kundur “Digital Media Fingerprinting: Techniques and Trends,” in Multimedia Security Handbook (Book Chapter) B. Furht; D. Kirovski (Ed.): pp. 577-603, CRC Press, 2004, ISBN: 9780849327735. (BibTeX | Links: ) @inbook{LuhKunMMSecHndbk04, title = {“Digital Media Fingerprinting: Techniques and Trends,” in Multimedia Security Handbook}, author = {W. Luh and D. Kundur}, editor = {B. Furht and D. Kirovski}, url = {http://www.crcpress.com/product/isbn/9780849327735}, isbn = {9780849327735}, year = {2004}, date = {2004-12-28}, pages = {577-603}, publisher = {CRC Press}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } |
William Luh Collusion-Resistant Fingerprinting for Multimedia in a Broadcast Channel Environment () 2004. @masterthesis{LuhMSThesis04, title = {Collusion-Resistant Fingerprinting for Multimedia in a Broadcast Channel Environment}, author = {William Luh}, year = {2004}, date = {2004-12-01}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {Digital fingerprinting is a method by which a copyright owner can uniquely embed a buyer-dependent, inconspicuous serial number (representing the fingerprint) into every copy of digital data that is legally sold. The buyer of a legal copy is then deterred from distributing further copies, because the unique fingerprint can be used to trace back the origin of the piracy. The major challenge in fingerprinting is collusion, an attack in which a coalition of pirates compare several of their uniquely fingerprinted copies for the purpose of detecting and removing the fingerprints. The contributions of this thesis are two-fold. First, this thesis motivates the need for robustness against large coalitions of pirates by introducing the concept of a malicious distributor that has been overlooked in prior work. A novel fingerprinting code that has superior codeword length in comparison to existing work under this novel malicious distributor scenario, is developed. In addition, ideas presented in the proposed ¯ngerprinting design can easily be applied to existing fingerprinting schemes, making them more robust to collusion attacks. Second, a new framework termed Joint Source Fingerprinting that integrates the processes of watermarking and codebook design is introduced. The need for this new paradigm is motivated by the fact that existing ¯ngerprinting methods result in a perceptually undistorted multimedia after collusion is applied. In contrast, the new paradigm equates the process of collusion amongst a coalition of pirates, to degrading the perceptual characteristics, and hence commercial value of the multimedia in ques- tion. Thus by enforcing that the process of collusion diminishes the commercial value of the content, the pirates are deterred from attacking the ¯ngerprints. A ¯ngerprint- ing algorithm for video as well as an e±cient means of broadcasting or distributing ¯ngerprinted video is also presented. Simulation results are provided to verify our theoretical and empirical observations.}, type = {M.S. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {masterthesis} } Digital fingerprinting is a method by which a copyright owner can uniquely embed a buyer-dependent, inconspicuous serial number (representing the fingerprint) into every copy of digital data that is legally sold. The buyer of a legal copy is then deterred from distributing further copies, because the unique fingerprint can be used to trace back the origin of the piracy. The major challenge in fingerprinting is collusion, an attack in which a coalition of pirates compare several of their uniquely fingerprinted copies for the purpose of detecting and removing the fingerprints. The contributions of this thesis are two-fold. First, this thesis motivates the need for robustness against large coalitions of pirates by introducing the concept of a malicious distributor that has been overlooked in prior work. A novel fingerprinting code that has superior codeword length in comparison to existing work under this novel malicious distributor scenario, is developed. In addition, ideas presented in the proposed ¯ngerprinting design can easily be applied to existing fingerprinting schemes, making them more robust to collusion attacks. Second, a new framework termed Joint Source Fingerprinting that integrates the processes of watermarking and codebook design is introduced. The need for this new paradigm is motivated by the fact that existing ¯ngerprinting methods result in a perceptually undistorted multimedia after collusion is applied. In contrast, the new paradigm equates the process of collusion amongst a coalition of pirates, to degrading the perceptual characteristics, and hence commercial value of the multimedia in ques- tion. Thus by enforcing that the process of collusion diminishes the commercial value of the content, the pirates are deterred from attacking the ¯ngerprints. A ¯ngerprint- ing algorithm for video as well as an e±cient means of broadcasting or distributing ¯ngerprinted video is also presented. Simulation results are provided to verify our theoretical and empirical observations. |
Raghav Dube Denial of Service Attacks: Path Reconstruction for IP Traceback using Adjusted Probabilistic Packet Marking () 2004. @masterthesis{DubMSThesis04, title = {Denial of Service Attacks: Path Reconstruction for IP Traceback using Adjusted Probabilistic Packet Marking}, author = {Raghav Dube}, year = {2004}, date = {2004-12-01}, address = {College Station, TX}, school = {Texas A&M University}, abstract = {The use of Internet has revolutionized the way information is exchanged, changed business paradigms and put mission critical and sensitive systems online. Any disruption of this connectivity and the plethora of services provided results in significant damages to everyone involved. Denial of Service (DoS) attacks are becoming increasingly common and are the cause of lost time and revenue. Flooding type DoS attacks use spoofed IP addresses to disguise the attackers. This makes identification of the attackers extremely difficult. This work proposes a new scheme that allows the victim of a DoS attack to identify the correct origin of the malicious traffic. The suggested mechanism requires routers to mark packets using adjusted probabilistic marking. This results in a lower number of packet-markings required to identify the traffic source. Unlike many related works, we use the existing IPv4 header structure to incorporate these markings. We simulate and test our algorithms using real Internet trace data to show that our technique is fast, and works successfully for a large number of distributed attackers.}, type = {M.S. Thesis}, keywords = {}, pubstate = {published}, tppubtype = {masterthesis} } The use of Internet has revolutionized the way information is exchanged, changed business paradigms and put mission critical and sensitive systems online. Any disruption of this connectivity and the plethora of services provided results in significant damages to everyone involved. Denial of Service (DoS) attacks are becoming increasingly common and are the cause of lost time and revenue. Flooding type DoS attacks use spoofed IP addresses to disguise the attackers. This makes identification of the attackers extremely difficult. This work proposes a new scheme that allows the victim of a DoS attack to identify the correct origin of the malicious traffic. The suggested mechanism requires routers to mark packets using adjusted probabilistic marking. This results in a lower number of packet-markings required to identify the traffic source. Unlike many related works, we use the existing IPv4 header structure to incorporate these markings. We simulate and test our algorithms using real Internet trace data to show that our technique is fast, and works successfully for a large number of distributed attackers. |
Nebu John Mathai 0.18 CMOS Implementation of a Video Watermarking Algorithm () 2004. @masterthesis{MatMSThesis04, title = {0.18 CMOS Implementation of a Video Watermarking Algorithm}, author = {Nebu John Mathai}, year = {2004}, date = {2004-12-01}, address = {Toronto, Canada}, school = {University of Toronto}, abstract = {We consider hardware implementation aspects of the digital watermarking problem through the implementation of a well-known video watermarking algorithm called Just Another Watermarking System (JAWS); we discuss the time and area constraints that must be satisfied by a successful hardware implementation. A hardware architecture that implements the algorithm under the constraints is then proposed. The architecture is analyzed to gain an understanding of the relationships between algorithmic features and implementation cost. Some general findings of this work that can be applied toward making algorithmic developments more amenable to hardware implementation are finally presented.}, type = {M.E. Report}, keywords = {}, pubstate = {published}, tppubtype = {masterthesis} } We consider hardware implementation aspects of the digital watermarking problem through the implementation of a well-known video watermarking algorithm called Just Another Watermarking System (JAWS); we discuss the time and area constraints that must be satisfied by a successful hardware implementation. A hardware architecture that implements the algorithm under the constraints is then proposed. The architecture is analyzed to gain an understanding of the relationships between algorithmic features and implementation cost. Some general findings of this work that can be applied toward making algorithmic developments more amenable to hardware implementation are finally presented. |