Is this your profile?
Claim your Citation Index profile in order to display more information about you and gain access to Libraries services. Just create or connect your ORCID iD.
Create or connect your ORCID iD
Works (31)
Updated: April 4th, 2024 21:39
2021 article
Advanced Secure DNS Name Autoconfiguration with Authentication for Enterprise IoT Network
2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM).
author keywords: Internet of Things; security; DNS; authentication; authorization; enterprise IoT network
TL;DR:
An Advanced Secure DNS name autoconfiguration with Authentication and Authorization for enterprise IoT network (ASDAI) is proposed, which provides the first model using the convergence of extended OAuth 2.0 and Kerberos v5.0.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: May 23, 2022
2018 article
Furnace: Self-service Tenant VMI for the Cloud
RESEARCH IN ATTACKS, INTRUSIONS, AND DEFENSES, RAID 2018, Vol. 11050, pp. 647–669.
author keywords: Cloud security; Virtual machine introspection; Sandboxing
TL;DR:
Furnace is introduced, an open source VMI framework that outperforms prior frameworks by satisfying both a cloud provider’s expectation of security and a tenant’'s desire to run their own custom VMI tools underneath their cloud VMs.
(via Semantic Scholar)
Source: Web Of Science
Added: August 12, 2019
2018 journal article
Goalkeeper: Comprehensive process enforcement from the hypervisor
COMPUTERS & SECURITY, 73, 459–473.
author keywords: Virtual machine introspection; Process whitelisting; Dynamic analysis; Virtualization; Security policy
TL;DR:
Goalkeeper is introduced, a hypervisor-based security system that focuses on asynchronous, stateless, and lightweight Virtual Machine Introspection (VMI) techniques to enforce comprehensive guest process security policies at scale across tens to hundreds of guests per hypervisor.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2018 article
Hyperagents: Migrating Host Agents to the Hypervisor
PROCEEDINGS OF THE EIGHTH ACM CONFERENCE ON DATA AND APPLICATION SECURITY AND PRIVACY (CODASPY'18), pp. 212–223.
author keywords: Cloud security; virtual machine introspection; computer forensics
TL;DR:
This work shows that a conventional off-the-shelf host agent can be feasibly transformed into a hyperagent and provide a powerful, efficient tool for defending virtualized systems.
(via Semantic Scholar)
Source: Web Of Science
Added: November 11, 2019
2017 chapter
Computer-Aided Human Centric Cyber Situation Awareness
In Theory and Models for Cyber Situation Awareness (pp. 3–25).
TL;DR:
This chapter provides an overview of Cyber Situational Awareness, an emerging research area in the broad field of cyber security, and discusses, at least at a high level, how to gain Cyber Situation Awareness.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2017 journal article
T-Chain: A General Incentive Scheme for Cooperative Computing
IEEE-ACM TRANSACTIONS ON NETWORKING, 25(4), 2122–2137.
author keywords: Cooperative communication; reciprocity; symmetric encryption
TL;DR:
The proposed incentive scheme, called Triangle Chaining (T-Chain), enforces reciprocity to minimize the exploitable aspects of other schemes that allow free-riding, and is suitable for dynamic environments with high churn.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2013 journal article
Deriving common malware behavior through graph clustering
COMPUTERS & SECURITY, 39, 419–430.
author keywords: Malware; Dynamic analysis; Graph clustering; Intrusion detection; Virtualization
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2012 conference paper
AntiLiar: Defending against cheating attacks in mesh based streaming
2012 IEEE 12th international conference on peer-to-peer computing (p2p), 115–125.
TL;DR:
Experimental results demonstrate that AntiLiar minimizes required costs, and improves service quality over alternatives in the face of cheating attacks.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2012 journal article
Interval-based flow watermarking for tracing interactive traffic
COMPUTER NETWORKS, 56(5), 1646–1665.
author keywords: Intrusion tracing; Stepping stones; Flow watermarking; Flow correlation
TL;DR:
This paper presents a new method of embedding a watermark in traffic timing, for purposes of tracing the traffic in the presence of flow splitting, chaff packets, timing perturbation, and repacketization, which has been implemented and tested on a large number of SSH traffic flows.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2012 journal article
Winnowing: Protecting P2P systems against pollution through cooperative index filtering
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 35(1), 72–84.
author keywords: Peer-to-peer; Pollution; Distributed hash table (DHT); Reputation; Filtering
TL;DR:
A novel distributed hash table (DHT)-based anti-pollution scheme called winnowing is proposed, which demonstrates the robustness of the privacy-preserving object reputation ofwinnowing to a variety of pollution attacks, and to attacks on the scheme itself.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2011 chapter
Defending against Sybil Nodes in BitTorrent
In NETWORKING 2011 (pp. 25–39).
TL;DR:
This paper presents defenses against threats from Sybil attackers in BitTorrent using a simple, direct reputation scheme called GOLF, which effectively detects and blocks potential attackers, despite false accusation.
(via Semantic Scholar)
link.springer.com (publisher PDF)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Crossref
Added: August 28, 2020
2011 journal article
Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 8(3), 434–449.
author keywords: Network-level security and protection; intrusion tracing; correlation; stepping stone
TL;DR:
This paper is the first that identifies accurate quantitative tradeoffs between the achievable correlation effectiveness and the defining characteristics of the timing perturbation; and a provable upper bound on the number of packets needed to achieve a desired correlation effectiveness, given the amount of timing perturgation.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2010 chapter
How the Public Views Strategies Designed to Reduce the Threat of Botnets
In Trust and Trustworthy Computing (pp. 337–351).
TL;DR:
The results of this pilot survey suggest that, in general, individuals would be willing to spend additional time each month meeting security requirements set by their ISPs, and that although only 50% of respondents would be willingness to pay their ISP more per month to protect themselves from cyber threats, more people would be able to do so if they perceived ISPs as being effective or very effective at reducing such threats.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2009 journal article
Edge-Reconfigurable Optical Networks (ERONs): Rationale, Network Design, and Evaluation
Journal of Lightwave Technology, 27(12), 1837–1845.
Contributors: L. Battestilli n , G. Karmous-Edwards n, n, G. Rouskas n , P. Vegesna n & A. Vishwanath n
author keywords: Dynamic circuits; network design; optical networks
TL;DR:
An algorithm for creating an ERON from an existing topology of static lightpaths is developed, and simulation results that quantify the benefits of ERONs, in terms of the number of light Paths that are needed when compared to a static configuration of independent and dedicated circuits are presented.
(via Semantic Scholar)
Sources: Web Of Science, Crossref, NC State University Libraries, ORCID
Added: August 6, 2018
2009 conference paper
Identification of bot commands by run-time execution monitoring
25th Annual Computer Security Applications Conference, 321–330.
TL;DR:
It is found that bots have distinct behavior patterns when they perform pre-programmed bot commands, and commands aiming to achieve the same result have very similar API call behavior in bot variants, even when they are from different bot families.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018
2005 chapter
Network Access Control for Mobile Ad-Hoc Networks
In Information and Communications Security (pp. 350–362).
TL;DR:
This paper presents a fully distributed key synchronization method based on stateless group key distribution, and localized packet retransmission, and demonstrates the proposed system is practical and effective.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2005 journal article
Network access control for mobile ad-hoc networks
Information and Communications Security, 3783, 350–362.
Source: NC State University Libraries
Added: August 6, 2018
2004 journal article
Bandwidth provisioning and pricing for networks with multiple classes of service
COMPUTER NETWORKS, 46(1), 41–52.
author keywords: connection management; SLA; DiffServ; bandwidth pricing; microeconomics
TL;DR:
This paper describes a scalable connection management strategy for QoS-enabled networks that maximizes profit, while reducing blocking experienced by users.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2004 journal article
Capacity planning of DiffServ networks with best-effort and Expedited Forwarding traffic
TELECOMMUNICATION SYSTEMS, 25(3-4), 193–207.
author keywords: DiffServ; capacity planning; Lagrangian relaxation
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2004 chapter
Certificate recommendations to improve the robustness of web of trust
In K. Zhang & Y. Zheng (Eds.), Information security: 7th international conference, ISC 2004, Palo Alto, CA, USA, September 27-29, 2004: Proceedings (Vol. 3225, pp. 292–303).
Ed(s): . K. Zhang & Y. Zheng
TL;DR:
This work proposes a heuristic method of graph augmentation for the certificate graph, and shows experimentally that it is close to optimal, and demonstrates that this method helps identify malicious users if there are any.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2004 chapter
Improving robustness of PGP keyrings by conflict detection
In Topics in cryptology, CT-RSA 2004 (Vol. 2964, pp. 194–207).
TL;DR:
This paper solves the problem of users who claim multiple, false identities, or who possess multiple keys, and shows that conflicting certificate information can be exploited to improve trustworthiness.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: NC State University Libraries
Added: August 6, 2018
2004 chapter
Storage-efficient stateless group key revocation
In K. Zhang & Y. Zheng (Eds.), Information security: 7th international conference, ISC 2004, Palo Alto, CA, USA, September 27-29, 2004: Proceedings (Vol. 3225, pp. 25–38).
Ed(s): . K. Zhang & Y. Zheng
TL;DR:
Two novel stateless group key revocation schemes named key-chain tree (KCT) and layered key- chain tree (LKCT), which combine one-way key chains with a logical key tree are introduced, which reduce the user storage requirements by trading off it with communication and computation costs.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2002 chapter
Analyzing intensive intrusion alerts via correlation
In G. V. A. Wespi & L. Deri (Eds.), Recent advances in intrusion detection, 5th international symposium, RAID 2002, Zurich, Switzerland, October 16-18, 2002: Proceedings (Vol. 2516, pp. 74–94).
Ed(s): G. A. Wespi & L. Deri
TL;DR:
This work develops three utilities (called adjustable graph reduction, focused analysis, and graph decomposition) to facilitate the analysis of large sets of correlated alerts and studies the effectiveness of this method through a case study with the network traffic captured at the DEF CON 8 Capture the Flag (CTF) event.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2002 conference paper
Inter-packet delay based correlation for tracing encrypted connections through stepping stones
In G. K. D. Gollmann & M. Waidner (Eds.), Computer security--ESORICS 2002: 7th European Symposium on Research in Computer Security, Zurich, Switzerland, October 14-16, 2002: proceedings (Lecture notes in computer science ; 2502) (Vol. 2502, pp. 244–263). New York: Springer.
Ed(s): G. D. Gollmann & M. Waidner
Source: NC State University Libraries
Added: August 6, 2018
2002 chapter
The economic impact of network pricing intervals
In Burkhard Stiller ...[et al.] (Eds.), From QoS provisioning to QoS charging: Third COST 263 International Workshop on Quality of Future Internet Services, QofIS 2002 and second International Workshop on Internet Charging and QoS Technologies, ICQT 2002, Zurich, Switzerland, October 16-18, 2002 (Vol. 2511, pp. 315–324).
TL;DR:
Experimental results indicate only a modest profit gain is achieved when smaller intervals are used as opposed to larger intervals, and given users preferences toward fewer price changes, smaller price intervals may hold few economic benefits.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2001 chapter
Optimal provisioning and pricing of Internet differentiated services in hierarchical markets
In Networking-ICN 2001: First international conference, Colmar, France, July 9-13, 2001: Proceedings (Vol. 2093, pp. 409–418).
TL;DR:
Methods for optimally provisioning and pricing differentiated services maximizes profit, while maintaining a low blocking probability for each service class are introduced.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2000 journal article
A distributed algorithm for delay-constrained unicast routing
IEEE-ACM TRANSACTIONS ON NETWORKING, 8(2), 239–250.
author keywords: delay constraints; distributed algorithms; quality of service; routing
Source: Web Of Science
Added: August 6, 2018
2000 article
Parallel image processing with the block data parallel architecture (Reprinted from Proceedings of the IEEE, vol 84, pg 947-968, 1996)
Alexander, W. E., Reeves, D. S., & Gloster, C. S. (2000, September). IBM JOURNAL OF RESEARCH AND DEVELOPMENT, Vol. 44, pp. 681–702.
TL;DR:
The goal of this paradigm is to reduce interprocessor communication, and relax the synchronization requirements for such applications, and it is demonstrated that the block data parallel architecture is a flexible, high-performance solution for numerous digital signal and image processing algorithms.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2000 chapter
QoS rewards and risks: A multi-market approach to resource allocation
In Networking 2000: Broadband communications, high performance networking, and performance of communication networks / IFIP-TC6/European Commission International Conference, Paris, France, May 2000, proceedings (Vol. 1815, pp. 945–956).
TL;DR:
A distributed multi-market approach to network resource allocation is introduced, in which link bandwidth is bought and sold in two types of markets: the reservation market and the spot market, which provide bandwidth guarantees and immediate availability.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
1999 journal article
A survey of statistical source models for variable-bit-rate compressed video
MULTIMEDIA SYSTEMS, 7(3), 199–213.
author keywords: video modeling; VBR; variable bit rate; MPEG; H.261; TES; self-similar
TL;DR:
This paper provides a survey of VBR source models which can be used to drive network simulations and presents models which have been used for VBR sources containing moderate-to-significant scene changes and moderate- to-full motion.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
1997 journal article
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 15(3), 332–345.
author keywords: admission control; multicast routing; quality of service; reverse path multicasting
TL;DR:
Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks, and semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QS requirements ofreal-time traffic.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
