Jump to content

Christian Skalka

The neutral encyclopedia of notable people
Christian Skalka
NationalityAmerican
OccupationComputer scientist, academic
EmployerUniversity of Vermont
Known forResearch in computer security, secure multiparty computation, and differential privacy
Alma materJohns Hopkins University

Christian Skalka is an American computer scientist known for his research contributions in the fields of computer security, programming language theory, and privacy-preserving computation. He holds a faculty position in the Department of Computer Science at the University of Vermont (UVM), where his work spans a range of topics including federated network security, secure aggregation protocols, intrusion detection, and formal methods for software verification.[1] Over the course of his academic career, Skalka has built a body of published research that bridges theoretical computer science with practical applications in cybersecurity, contributing to both peer-reviewed venues and federally funded research initiatives.

Education

Christian Skalka pursued graduate studies in computer science, with his doctoral training grounding him in programming language theory and formal methods, areas that would later inform his research into type systems, abstract interpretation, and security verification.[2] His academic training provided the theoretical foundation for subsequent work combining formal logic and type-theoretic approaches with applied problems in computer security, a pairing that has characterized much of his scholarly output throughout his career.[3]

Career

Skalka has spent the majority of his academic career at the University of Vermont, where he holds a faculty appointment in the Department of Computer Science.[4] In this role, he has taught courses related to programming languages, computer security, and formal methods, while simultaneously directing and participating in research projects funded by federal grants and supported through interdisciplinary collaborations.[5]

Throughout his tenure at UVM, Skalka has secured research funding from the National Science Foundation (NSF) to support projects addressing pressing challenges in network and software security. Among his funded initiatives, the NSF awarded a grant titled "SaTC: CORE: Small: Collaborative: A New Approach to Federated Network Security," which received $212,872 in funding beginning on July 19, 2017, administered through the University of Vermont and State Agricultural College.[6] This project focused on developing novel frameworks for securing federated network systems, an area that intersects with his later work on privacy-preserving computation for distributed and federated learning environments.

Earlier in his career, Skalka also received NSF funding for the project "TWC: Medium: Collaborative: Retrofitting Software for Defense-in-Depth," which was awarded $299,243 starting August 20, 2014, also administered through the University of Vermont and State Agricultural College.[7] This earlier grant supported research into methods for enhancing the security posture of existing software systems without requiring complete redesign, an approach aligned with defense-in-depth security philosophy that layers multiple protective mechanisms to mitigate vulnerabilities. Together, these two NSF-funded projects, totaling $512,115 in federal research support, illustrate the trajectory of Skalka's research interests: moving from software-level security retrofitting toward network-level and distributed system security challenges.[8]

In addition to his funded research, Skalka has been an active contributor to the broader computer science research community, publishing extensively in peer-reviewed conferences and journals across security, formal methods, and interdisciplinary health informatics applications of machine learning.[9]

Research

Christian Skalka's research career, as reflected in his body of published work, spans several interconnected areas within computer science, most centrally computer security, secure computation protocols, and formal verification techniques rooted in programming language theory.

Secure Computation and Privacy-Preserving Protocols

A significant portion of Skalka's more recent research addresses the challenge of enabling privacy-preserving computation in distributed and federated settings. His 2021 paper "Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors," published at the USENIX Security Symposium, has garnered substantial attention within the field, accumulating 120 citations according to Semantic Scholar metrics.[10] This work explores how cryptographic hardness assumptions, specifically those related to the Learning with Errors (LWE) problem, can be leveraged to construct efficient protocols for secure aggregation in federated learning contexts, while simultaneously providing differential privacy guarantees to protect individual data contributions.

Building on this line of inquiry, Skalka's 2022 paper "Secret Sharing Sharing For Highly Scalable Secure Aggregation," posted to arXiv.org, extends secret sharing techniques to improve scalability in secure aggregation systems, a critical concern as federated learning deployments grow to encompass larger numbers of participating clients.[11] These contributions position Skalka's research within the active subfield of privacy-enhancing technologies for machine learning, where the tension between computational efficiency, scalability, and rigorous privacy guarantees remains a central research challenge.

Intrusion Detection and Network Security

Skalka's work on network and system security is further exemplified by his 2021 publication "Methods for Host-Based Intrusion Detection with Deep Learning," which appeared in the journal Digital Threats: Research and Practice (DTRAP) and has accumulated 33 citations.[12] This research applies deep learning methodologies to the problem of detecting malicious activity on individual host systems, contributing to the growing body of literature that integrates machine learning techniques into traditional cybersecurity defense mechanisms. This area of study connects directly to his NSF-funded work on federated network security, as both lines of research address the challenge of detecting and mitigating threats across distributed computing environments.

Formal Methods and Type Systems

Reflecting his academic training in programming language theory, Skalka has produced a series of publications applying formal methods, type systems, and abstract interpretation to problems in software security and correctness verification. His 2020 paper "Types and Abstract Interpretation for Authorization Hook Advice," presented at the IEEE Computer Security Foundations Symposium, examines how type-theoretic frameworks combined with abstract interpretation techniques can be used to statically verify the correctness of authorization mechanisms embedded within software systems.[13]

Related work includes his 2018 paper "Syntactic Type Soundness for HM(X)," which addresses foundational questions in type system design, specifically the soundness of the Hindley-Milner type system extended with constraint-based polymorphism, denoted HM(X).[14] Additionally, his 2020 paper "Maybe tainted data: Theory and a case study," published in the Journal of Computing and Security, explores taint analysis techniques for tracking potentially compromised data flows through software systems, a technique with direct applications in vulnerability detection and mitigation.[15]

Skalka's contributions to network-level formal verification are also evident in his 2019 paper "Proof-Carrying Network Code," presented at the Conference on Computer and Communications Security (CCS), which examines mechanisms for verifying the correctness and safety of network protocols through embedded proof artifacts.[16]

Interdisciplinary Health Informatics Applications

Beyond core computer security and formal methods research, Skalka has contributed to interdisciplinary projects applying machine learning and cyber-physical systems to health informatics. His 2019 paper "Predicting Posttraumatic Stress Disorder Risk: A Machine Learning Approach," published in JMIR Mental Health, has accumulated 61 citations, reflecting significant interest from the mental health and clinical informatics research communities.[17] This work is complemented by a related 2019 study, "The Short-Term Dynamics of PTSD Symptoms During the Acute Post Trauma Period," published in the journal Depression and Anxiety, which has been cited 21 times.[18]

Skalka has also contributed to the development of cyber-physical systems for healthcare monitoring, as demonstrated in his 2019 paper "A Cyber-Physical System for Near Real-Time Monitoring of At-Home Orthopedic Rehabilitation and Mobile-Based Provider-Patient Communications to Improve Adherence: Development and Formative Evaluation," published in JMIR Human Factors.[19] This research demonstrates the application of his technical expertise in systems design and data analysis to practical challenges in remote patient monitoring and rehabilitation adherence.

Recognition

According to citation metrics compiled by Semantic Scholar, Skalka's publication record encompasses 71 total papers, which together have accumulated 1,039 citations, yielding an h-index of 16.[20] His research has been recognized through acceptance at competitive, peer-reviewed venues including the USENIX Security Symposium, the IEEE Computer Security Foundations Symposium, and the ACM Conference on Computer and Communications Security, all of which are considered leading venues in the computer security research community.[21] His most highly cited work, the 2021 USENIX Security Symposium paper on differentially private secure aggregation, has become a frequently referenced contribution within the federated learning and privacy-preserving computation literature, with 120 citations recorded as of recent tracking.[22]

Skalka's research has additionally been supported through competitive federal funding from the National Science Foundation, having secured two separate awards totaling $512,115 across projects addressing federated network security and software defense-in-depth strategies.[23]

Publications

  • Skalka, C. et al. "Secret Sharing Sharing For Highly Scalable Secure Aggregation." arXiv.org (2022).
  • Skalka, C. et al. "Methods for Host-Based Intrusion Detection with Deep Learning." Digital Threats: Research and Practice (2021).
  • Skalka, C. et al. "Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors." USENIX Security Symposium (2021).
  • Skalka, C. et al. "Types and Abstract Interpretation for Authorization Hook Advice." IEEE Computer Security Foundations Symposium (2020).
  • Skalka, C. et al. "Maybe tainted data: Theory and a case study." Journal of Computing and Security (2020).
  • Skalka, C. et al. "A Cyber-Physical System for Near Real-Time Monitoring of At-Home Orthopedic Rehabilitation and Mobile-Based Provider-Patient Communications to Improve Adherence: Development and Formative Evaluation." JMIR Human Factors (2019).
  • Skalka, C. et al. "Predicting Posttraumatic Stress Disorder Risk: A Machine Learning Approach." JMIR Mental Health (2019).
  • Skalka, C. et al. "Proof-Carrying Network Code." Conference on Computer and Communications Security (2019).
  • Skalka, C. et al. "The Short-Term Dynamics of PTSD Symptoms During the Acute Post Trauma Period." Depression and Anxiety (2019).
  • Skalka, C. et al. "Syntactic Type Soundness for HM(X)." (2018).
  1. University of Vermont Department of Computer Science faculty directory.
  2. Semantic Scholar author profile: Christian Skalka.
  3. DBLP bibliography: Christian Skalka.
  4. University of Vermont faculty page, Department of Computer Science.
  5. University of Vermont course catalog, Computer Science Department.
  6. National Science Foundation award abstract, "SaTC: CORE: Small: Collaborative: A New Approach to Federated Network Security," Award ID associated with University of Vermont, effective July 19, 2017.
  7. National Science Foundation award abstract, "TWC: Medium: Collaborative: Retrofitting Software for Defense-in-Depth," effective August 20, 2014.
  8. National Science Foundation award database, University of Vermont institutional grants.
  9. Semantic Scholar author profile: Christian Skalka.
  10. Semantic Scholar citation data for "Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors," USENIX Security Symposium, 2021.
  11. arXiv.org preprint, "Secret Sharing Sharing For Highly Scalable Secure Aggregation," 2022.
  12. Semantic Scholar citation data for "Methods for Host-Based Intrusion Detection with Deep Learning," DTRAP, 2021.
  13. IEEE Computer Security Foundations Symposium proceedings, "Types and Abstract Interpretation for Authorization Hook Advice," 2020.
  14. Semantic Scholar entry, "Syntactic Type Soundness for HM(X)," 2018.
  15. Journal of Computing and Security, "Maybe tainted data: Theory and a case study," 2020.
  16. Conference on Computer and Communications Security proceedings, "Proof-Carrying Network Code," 2019.
  17. Semantic Scholar citation data for "Predicting Posttraumatic Stress Disorder Risk: A Machine Learning Approach," JMIR Mental Health, 2019.
  18. Semantic Scholar citation data for "The Short-Term Dynamics of PTSD Symptoms During the Acute Post Trauma Period," Depression and Anxiety, 2019.
  19. JMIR Human Factors, "A Cyber-Physical System for Near Real-Time Monitoring of At-Home Orthopedic Rehabilitation and Mobile-Based Provider-Patient Communications to Improve Adherence: Development and Formative Evaluation," 2019.
  20. Semantic Scholar author profile, citation metrics for Christian Skalka.
  21. Conference proceedings listings for USENIX Security Symposium, IEEE CSF, and ACM CCS.
  22. Semantic Scholar citation data for "Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with Errors," 2021.
  23. National Science Foundation award database, University of Vermont institutional grants for Christian Skalka.