Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John L. Schultz

dblp:44/5552 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7Security and privacy · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
group key agreement
0.012004
Secure Group Communication Using Robust Contributory Key Agreement · IEEE Trans. Parallel Distributed Syst. 2004
Distributed systems
fault tolerance
0.012004
Secure Group Communication Using Robust Contributory Key Agreement · IEEE Trans. Parallel Distributed Syst. 2004
Distributed systems
group communication
0.012004
Secure Group Communication Using Robust Contributory Key Agreement · IEEE Trans. Parallel Distributed Syst. 2004

Methods — techniques the papers use, named apart from their topics

virtual synchrony · 0.1group diffie-hellman · 0.1
YearPublicationVenuePosition
2019 Deploying Intrusion-Tolerant SCADA for the Power Grid
abstract
While there has been considerable research on making power grid Supervisory Control and Data Acquisition (SCADA) systems resilient to attacks, the problem of transitioning these technologies into deployed SCADA systems remains largely unaddressed. We describe our experience and lessons learned in deploying an intrusion-tolerant SCADA system in two realistic environments: a red team experiment in 2017 and a power plant test deployment in 2018. These experiences resulted in technical lessons related to developing an intrusion-tolerant system with a real deployable application, preparing a system for deployment in a hostile environment, and supporting protocol assumptions in that hostile environment. We also discuss some meta-lessons regarding the cultural aspects of transitioning academic research into practice in the power industry.
Amy Babay, John L. Schultz, Thomas Tantillo, Samuel Beckley, Eamon Jordan, Kevin Ruddell, Kevin Jordan, Yair Amir
DSN2
2018 Toward an Intrusion-Tolerant Power Grid: Challenges and Opportunities
abstract
While cyberattacks pose a relatively new challenge for power grid control systems, commercial cloud systems have needed to address similar threats for many years. However, technology and approaches developed for cloud systems do not necessarily transfer directly to the power grid, due to important differences between the two domains. We discuss our experience adapting intrusion-tolerant cloud technologies to the power domain and describe the challenges we have encountered and potential directions for overcoming those obstacles.
Amy Babay, John L. Schultz, Thomas Tantillo, Yair Amir
ICDCS2
2017 Structured Overlay Networks for a New Generation of Internet Services
abstract
The dramatic success and scaling of the Internet was made possible by the core principle of keeping it simple in the middle and smart at the edge (or the end-to-end principle). However, new applications bring new demands, and for many emerging applications, the Internet paradigm presents limitations. For applications in this new generation of Internet services, structured overlay networks offer a powerful framework for deploying specialized protocols that can provide new capabilities beyond what the Internet natively supports by leveraging global state and in-network processing. The structured overlay concept includes three principles: A resilient network architecture, a flexible overlay node software architecture that exploits global state and unlimited programmability, and flow-based processing. We demonstrate the effectiveness of structured overlay networks in supporting today's demanding applications and propose forward-looking ideas for leveraging the framework to develop protocols that push the boundaries of what is possible in terms of performance and resilience.
Amy Babay, Claudiu Danilov 0001, John Lane, Michal Miskin-Amir, Daniel Obenshain, John L. Schultz, Jonathan Robert Stanton, Thomas Tantillo, Yair Amir
ICDCS6
2016 Practical Intrusion-Tolerant Networks
abstract
As the Internet becomes an important part of the infrastructure our society depends on, it is crucial to construct networks that are able to work even when part of the network is compromised. This paper presents the first practical intrusion-tolerant network service, targeting high-value applications such as monitoring and control of global clouds and management of critical infrastructure for the power grid. We use an overlay approach to leverage the existing IP infrastructure while providing the required resiliency and timeliness. Our solution overcomes malicious attacks and compromises in both the underlying network infrastructure and in the overlay itself. We deploy and evaluate the intrusion-tolerant overlay implementation on a global cloud spanning East Asia, North America, and Europe, and make it publicly available.
Daniel Obenshain, Thomas Tantillo, Amy Babay, John L. Schultz, Andrew Newell, Md. Endadul Hoque, Yair Amir, Cristina Nita-Rotaru
ICDCS4
2013 Efficient and Private Three-Party Publish/Subscribe
Giovanni Di Crescenzo, Jim Burns, Brian A. Coan, John L. Schultz, Jonathan Robert Stanton, Simon Tsang, Rebecca N. Wright
NSS4
2004 Secure Group Communication Using Robust Contributory Key Agreement
abstract
Contributory group key agreement protocols generate group keys based on contributions of all group members. Particularly appropriate for relatively small collaborative peer groups, these protocols are resilient to many types of attacks. Unlike most group key distribution protocols, contributory group key agreement protocols offer strong security properties such as key independence and perfect forward secrecy. We present the first robust contributory key agreement protocol resilient to any sequence of group changes. The protocol, based on the Group Diffie-Hellman contributory key agreement, uses the services of a group communication system supporting virtual synchrony semantics. We prove that it provides both virtual synchrony and the security properties of Group Diffie-Hellman, in the presence of any sequence of (potentially cascading) node failures, recoveries, network partitions, and heals. We implemented a secure group communication service, Secure Spread, based on our robust key agreement protocol and Spread group communication system. To illustrate its practicality, we compare the costs of establishing a secure group with the proposed protocol and a protocol based on centralized group key management, adapted to offer equivalent security properties.
Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, John L. Schultz, Jonathan Robert Stanton, Gene Tsudik
IEEE Trans. Parallel Distributed Syst.4
2001 Exploring Robustness in Group Key Agreement
abstract
Secure group communication is crucial for building distributed applications that work in dynamic environments and communicate over unsecured networks (e.g. the Internet). Key agreement is a critical part of providing security services for group communication systems. Most of the current contributory key agreement protocols are not designed to tolerate failures and membership changes during execution. In particular, nested or cascaded group membership events (such as partitions) are not accommodated. We present the first robust contributory key agreement protocols, resilient to any sequence of events while preserving the group communication membership and ordering guarantees.
Yair Amir, Cristina Nita-Rotaru, John L. Schultz, Jonathan Robert Stanton, Yongdae Kim, Gene Tsudik
ICDCS3
2000 Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
abstract
The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integration with reliable group communication services presents a formidable challenge, This paper discusses some important integration issues, reports on our implementation experience and provides experimental results. Our approach utilizes distributed group key management developed by the Cliques project. We enhance it to handle processor and network faults (under a fail-stop or crash-and-recover model) and asynchronous membership events (such as joins, leaves, merges and network partitions). Our approach leverages the strong properties provided by the Spread group communication system, such as message ordering, clean failure semantics and a membership service. The result of this work is a secure group communications layer and an API that provide the application programmer with both standard group communication services and flexible security services.
Jonathan Robert Stanton, Yair Amir, Damian Hasse, Giuseppe Ateniese, Yongdae Kim, Cristina Nita-Rotaru, Theo Schlossnagle, John L. Schultz, Gene Tsudik
ICDCS8