Demo Data from EDBT 2026 / reviewers in the wild / expert
John H. Ring
dblp:252/3936 · also John Henry Ring IV
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-7948-9958ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 since 2021
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
2 papers |
Privacy and data protection · 44% Cryptographic protocols and secure computation · 34% Authentication and access control · 22% | |
| Computer networks
1 paper |
Software-defined and programmable networks · 77% Internet of things and sensor networks · 23% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy-preserving machine learning
federated learning privacy |
0.6 | 1 | 2022 | Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors · USENIX Security Symposium 2022 |
Cryptographic protocols and secure computation
secure aggregation |
0.6 | 1 | 2022 | Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors · USENIX Security Symposium 2022 |
Authentication and access control › security policy
security policy verification |
0.4 | 1 | 2019 | Proof-Carrying Network Code · CCS 2019 |
Privacy and data protection
differential privacy |
0.2 | 1 | 2022 | Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors · USENIX Security Symposium 2022 |
Internet of things and sensor networks
iot security |
0.1 | 1 | 2019 | Proof-Carrying Network Code · CCS 2019 |
Methods — techniques the papers use, named apart from their topics
proof-carrying code · 0.8proof-carrying authorization · 0.8learning with errors · 0.6differential privacy · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors
Timothy Stevens, Christian Skalka, Christelle Vincent, John H. Ring, Samuel Clark, Joseph P. Near |
USENIX Security Symposium | 4 |
| 2019 | Proof-Carrying Network CodeabstractComputer networks often serve as the first line of defense against malicious attacks. Although there are a growing number of tools for defining and enforcing security policies in software-defined networks (SDNs), most assume a single point of control and are unable to handle the challenges that arise in networks with multiple administrative domains. For example, consumers may want want to allow their home IoT networks to be configured by device vendors, which raises security and privacy concerns. In this paper we propose a framework called Proof-Carrying Network Code (PCNC) for specifying and enforcing security in SDNs with interacting administrative domains. Like Proof-Carrying Authorization (PCA), PCNC provides methods for managing authorization domains, and like Proof-Carrying Code (PCC), PCNC provides methods for enforcing behavioral properties of network programs. We develop theoretical foundations for PCNC and evaluate it in simulated and real network settings, including a case study that considers security in IoT networks for home health monitoring. Christian Skalka, John H. Ring, David Darais, Minseok Kwon, Sahil Gupta, Kyle Diller, Steffen Smolka, Nate Foster |
CCS | 2 |