Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Zongwei Zhou is active.

Publication


Featured researches published by Zongwei Zhou.


ieee symposium on security and privacy | 2010

TrustVisor: Efficient TCB Reduction and Attestation

Jonathan M. McCune; Yanlin Li; Ning Qu; Zongwei Zhou; Anupam Datta; Virgil D. Gligor; Adrian Perrig

An important security challenge is to protect the execution of security-sensitive code on legacy systems from malware that may infect the OS, applications, or system devices. Prior work experienced a tradeoff between the level of security achieved and efficiency. In this work, we leverage the features of modern processors from AMD and Intel to overcome the tradeoff to simultaneously achieve a high level of security and high performance. We present TrustVisor, a special-purpose hypervisor that provides code integrity as well as data integrity and secrecy for selected portions of an application. TrustVisor achieves a high level of security, first because it can protect sensitive code at a very fine granularity, and second because it has a very small code base (only around 6K lines of code) that makes verification feasible. TrustVisor can also attest the existence of isolated execution to an external entity. We have implemented TrustVisor to protect security-sensitive code blocks while imposing less than 7% overhead on the legacy OS and its applications in the common case.


ieee symposium on security and privacy | 2012

Building Verifiable Trusted Path on Commodity x86 Computers

Zongwei Zhou; Virgil D. Gligor; James Newsome; Jonathan M. McCune

A trusted path is a protected channel that assures the secrecy and authenticity of data transfers between a users input/output (I/O) device and a program trusted by that user. We argue that, despite its incontestable necessity, current commodity systems do not support trusted path with any significant assurance. This paper presents a hyper visor-based design that enables a trusted path to bypass an untrusted operating-system, applications, and I/O devices, with a minimal Trusted Computing Base (TCB). We also suggest concrete I/O architectural changes that will simplify future trusted-path system design. Our system enables users to verify the states and configurations of one or more trusted-paths using a simple, secret less, hand-held device. We implement a simple user-oriented trusted path as a case study.


trust and trustworthy computing | 2012

Trustworthy execution on mobile devices: what security properties can my mobile platform give me ?

Amit Vasudevan; Emmanuel Owusu; Zongwei Zhou; James Newsome; Jonathan M. McCune

We are now in the post-PC era, yet our mobile devices are insecure. We consider the different stake-holders in today’s mobile device ecosystem, and analyze why widely-deployed hardware security primitives on mobile device platforms are inaccessible to application developers and end-users. We systematize existing proposals for leveraging such primitives, and show that they can indeed strengthen the security properties available to applications and users, all without reducing the properties currently enjoyed by OEMs and network carriers. We also highlight shortcomings of existing proposals and make recommendations for future research that may yield practical, deployable results.


international conference on network protocols | 2011

Network fault localization with small TCB

Xin Zhang; Zongwei Zhou; Geoffrey Hasker; Adrian Perrig; Virgil D. Gligor

Clear evidence indicates the existence of compromised routers in ISP and enterprise networks. Fault localization (FL) protocols enable a network to localize specific links of compromised routers sabotaging network data delivery and are recognized as an essential means to enhancing network availability in the face of targeted attacks. However, theoretically proven lower bounds have shown that secure FL protocols in the current network infrastructure inevitably incur prohibitive overhead. We observe the current limits are due to a lack of trust relationships among network nodes. We demonstrate that we can achieve much higher FL efficiency by leveraging trusted computing technology to design a trusted network-layer architecture, Tru eN et, with a small Trusted Computing Base (TCB). We intend Tru e N e t to serve as a case study that demonstrates trusted computings ability in yielding tangible and measurable benefits for secure network protocol designs.


trust and trustworthy computing | 2013

KISS: “Key It Simple and Secure” Corporate Key Management

Zongwei Zhou; Jun Han; Yue-Hsun Lin; Adrian Perrig; Virgil D. Gligor

Deploying a corporate key management system faces fundamental challenges, such as fine-grained key usage control and secure system administration. None of the current commercial systems (either based on software or hardware security modules) or research proposals adequately address both challenges with small and simple Trusted Computing Base (TCB). This paper presents a new key management architecture, called KISS, to enable comprehensive, trustworthy, user-verifiable, and cost-effective key management. KISS protects the entire life cycle of cryptographic keys. In particular, KISS allows only authorized applications and/or users to use the keys. Using simple devices, administrators can remotely issue authenticated commands to KISS and verify system output. KISS leverages readily available commodity hardware and trusted computing primitives to design system bootstrap protocols and management mechanisms, which protects the system from malware attacks and insider attacks.


computer and communications security | 2015

Trusted Display on Untrusted Commodity Platforms

Miao Yu; Virgil D. Gligor; Zongwei Zhou

A trusted display service assures the confidentiality and authenticity of content output by a security-sensitive application and thus prevents a compromised commodity operating system or application from surreptitiously reading or modifying the displayed output. Past approaches have failed to provide trusted display on commodity platforms that use modern graphics processing units (GPUs). For example, full GPU virtualization encourages the sharing of GPU address space with multiple virtual machines {\em without} providing adequate hardware protection mechanisms; e.g., address-space separation and instruction execution control. This paper proposes a new trusted display service that has a minimal trusted code base and maintains full compatibility with commodity computing platforms. The service relies on a GPU separation kernel that (1) defines different types of GPU objects, (2) mediates access to security-sensitive objects, and (3) emulates object whenever required by commodity-platform compatibility. The separation kernel employs a new address-space separation mechanism that avoids the challenging problem of GPU instruction verification without adequate hardware support. The implementation of the trusted-display service has a code base that is two orders of magnitude smaller than other similar services, such as those based on full GPU virtualization. Performance measurements show that the trusted-display overhead added over and above that of the underlying trusted system is fairly modest.


scalable trusted computing | 2012

Using trustworthy host-based information in the network

Bryan Parno; Zongwei Zhou; Adrian Perrig

As hardware support for improved endhost security becomes ubiquitous, it is important to consider how network security and performance can benefit from these improvements. If portions of each endhost can be trusted, then network infrastructure no longer needs to arduously and imprecisely reconstruct data already known by the endhosts. Through the design of a general-purpose architecture we call Assayer, we explore issues in providing trusted host-based data, including the balance between useful data and user privacy, and the tradeoffs between security and efficiency. We also evaluate the usefulness of such information in several case studies. We implement and evaluate a basic Assayer prototype. Our prototype requires fewer than 1,000 lines of code on the endhost. Endhosts can annotate their outbound traffic in a few microseconds, and these annotations can be checked efficiently; even packet-level annotations on a gigabit link can be checked with a loss in throughput of only 13.1%.


ieee symposium on security and privacy | 2015

Dancing with Giants: Wimpy Kernels for On-Demand I/O Isolation

Zongwei Zhou; Miao Yu; Virgil D. Gligor

To be trustworthy, security-sensitive applications must be small and simple--or wimpy. Because of their limited size and functions, they must securely compose with large, untrusted commodity systems--or giants--to survive. A security architecture based on a wimpy kernel can provide on-demand isolated I/O channels for wimp applications without bloating the underlying trusted computing base.


network and distributed system security symposium | 2014

ROPecker: A Generic and Practical Approach For Defending Against ROP Attacks.

Yueqiang Cheng; Zongwei Zhou; Miao Yu; Xuhua Ding; Robert H. Deng


ieee symposium on security and privacy | 2014

Dancing with Giants: Wimpy Kernels for On-Demand Isolated I/O

Zongwei Zhou; Miao Yu; Virgil D. Gligor

Collaboration


Dive into the Zongwei Zhou's collaboration.

Top Co-Authors

Avatar

Virgil D. Gligor

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Miao Yu

Shanghai Jiao Tong University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Bryan Parno

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Amit Vasudevan

Association for Computing Machinery

View shared research outputs
Top Co-Authors

Avatar

Emmanuel Owusu

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Xin Zhang

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Anupam Datta

Carnegie Mellon University

View shared research outputs
Researchain Logo
Decentralizing Knowledge