Zobrazeno 1 - 10
of 109
pro vyhledávání: '"Gligor, Virgil D."'
Autor:
Hsu-Chun Hsiao, Kim, Tiffany, Sangjae Yoo, Zhang, Xin, Lee, Soo Bum, Gligor, Virgil D., Perrig, Adrian
We propose STRIDE, a new Internet architecture that provides strong DDoS defense mechanisms for both public services and private end-to-end communication. This new architecture presents several novel concepts including long-term static paths, bandwid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::545e5a14c81139460d73144f0e903146
Recent trends in public-key infrastructure research explore the tradeoff between decreased trust in certificate authorities (CAs), the level of security achieved, the communication overhead (bandwidth and latency) for setting up a secure connection (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::388ade19e0a8f8cf652c42e9763865dc
Autor:
Shieh, Shiuh-Pyng, Gligor, Virgil D.
Publikováno v:
Journal of Computer Security. 1996, Vol. 4 Issue 2/3, p123. 26p. 5 Diagrams.
Autor:
Kang, Min Suk, Gligor, Virgil D.
How pervasive is the vulnerability to linkflooding attacks that degrade connectivity of thousands of Internet hosts? Are some network topologies and geographic regions more vulnerable than others? Do practical countermeasures exist? To answer these q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27e05c58786da0b15892890819328c0c
In wireless sensor networks (WSNs), the Eschenauer–Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although the connectivity properties of secure WSNs with the EG scheme have been extensively investigate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17c551d95d0d2aceef5c1463b8a4cd19
We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically, we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bde2ffeb490744d51e7c5201eba2c0a
The seminal q-composite key predistribution scheme [3] (IEEE S&P 2003) is used prevalently for secure communications in large-scale wireless sensor networks (WSNs). Yagan [12] (IEEE IT 2012) and we [15] (IEEE ISIT 2013) explore topological properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cca2abb821ed623fd8f26a67ea8df31
Autor:
Gligor, Virgil D., Wing, Jeannette M.
We argue that a general theory of trust in networks of humans and computers must be build on both a theory of behavioral trust and a theory ofcomputational trust. This argument is motivated by increased participation of people in social networking, c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::315c721def560a8e75f573b38ec2fec9
Network-layer capabilities offer strong protection against link flooding by authorizing individual flows with unforgeable credentials (i.e., capabilities). However, the capability setup channel is vulnerable to flooding attacks that prevent legitimat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c927ebcef0019bf61e0b0376f62b87b
Autor:
Lee, Soo Bum, Gligor, Virgil D.
Malware-contaminated hosts organized as a "bot network" can target and flood network links (e.g., routers). Yet, none of the countermeasures to link flooding proposed to date have provided dependable link access (i.e., bandwidth guarantees) for legit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::388c88a72a236fe73c9f6f28a63eec8e