Florian Kerschbaum receives 2019 Outstanding Young Computer Science Researcher Award

Monday, April 6, 2020

Professor Florian Kerschbaum has received a 2019 Outstanding Young Computer Science Researcher Award from CS-Can/Info-Can, the nation’s professional society dedicated to representing all aspects of computer science and the interests of the discipline to Canadians.

Conferred since 2009, these annual awards recognize excellence in computer science research. They are awarded to top faculty members in Canadian computer science departments, schools and faculties who are within the first ten years of their career after completing their PhD.

“Congratulations to Florian on his receiving an Outstanding Young Computer Science Researcher Award from CS-Can/Info-Can,” said Mark Giesbrecht, Director of the David R. Cheriton School of Computer Science.

photo of Professor Florian Kerschbaum“Florian is an accomplished expert in searching and processing encrypted data — keeping data secure, private and encrypted in the cloud while still allowing it to be searched and processed. His contributions to computer security, privacy-enhancing technologies, and database research are both respected internationally by his academic peers as well as adopted by leading high-tech companies, including SAP and Microsoft. His teaching of undergrads, supervision of graduate students at both Waterloo and SAP, and postdoctoral mentorship are exemplary. Shortly after his appointment, he took on a senior leadership role as the inaugural Director of the Cybersecurity and Privacy Institute, and he has secured more than $1.7 million in industry funding. Florian is clearly an outstanding computer scientist across research, teaching and service.”

Professor Kerschbaum is the eighth faculty member at the Cheriton School of Computer Science to receive an Outstanding Young Computer Science Researcher Award from CS-Can/Info-Can. Previous recipients are Professor Daniel Vogel (2018 recipient), Professor Lap Chi Lau (2016 recipient), Professor Kate Larson (2015 recipient), Professor Ondřej Lhoták (2012 recipient), Professor Ian Goldberg (2010 recipient), Professor Bin Ma (2009 recipient) and Professor Éric Schost (2009 recipient).

About Professor Kerschbaum

Professor Kerschbaum joined the Cheriton School of Computer Science in 2017 as an Associate Professor. Previously, he was the Chief Research Expert at SAP in Karlsruhe, Germany from 2005 to 2016 and a software architect at Arxan Technologies in San Francisco from 2002 to 2004. In 2018 he became the inaugural Director of the Cybersecurity and Privacy Institute and in 2019 was named the NSERC/RBC Industrial Research Chair in Data Security. That same year he was recognized as a Distinguished Member by the Association for Computing Machinery for his outstanding scientific contributions.

Professor Kerschbaum holds a PhD in computer science from the Karlsruhe Institute of Technology and a master’s degree from Purdue University.

About Professor Kerschbaum’s research

Professor Kerschbaum’s research develops methods to protect data by encryption, while still allowing it to be processed efficiently. To this end, he has developed and helped deploy several application-specific methods for searching and computing on encrypted data. He has developed a comprehensive set of searchable encryption algorithms for database operations. These include property-preserving encryption algorithms that enable efficient search without modification of the database management system and can withstand snapshot attacks much better than other order-preserving algorithms.

Professor Kerschbaum has also developed methods to compile secure multi-party computation protocols from ideal functionality specifications. He developed the first compiler optimization technique operating at the source language level, transforming an ideal functionality into a protocol that interleaves securely and locally computed steps.

He has also pioneered the use of multi-party computations in supply chain management, including protocols for planning, lot size planning, and detailed scheduling. These planning methods have significant economic potential because they overcome hurdles to data sharing in current supply chain management planning. Collaborative methods have enormous savings potential over local planning, but they often are not implemented because of concerns what the necessary data might reveal. Multi-party computations enable implementing the planning methods over encrypted data. As the coordinator of the EU-funded project SECURESCM, Professor Kerschbaum led an efficiency improvement in linear programming over encrypted data by more than five orders of magnitude.

With his previous doctoral student, Marek Jawurek, Professor Kerschbaum developed methods for maintaining privacy in smart grids. This included protocols for billing, spatial and temporal aggregation and demand-response verification that do not reveal a household’s consumption data, but are also secure against misreporting. For this research, his PhD student was awarded a prestigious 2014 ACM SIGSAC doctoral dissertation award.

Future directions

Professor Kerschbaum’s future work aims to address the security and privacy challenges stemming from data processing using machine learning. Machine learning has become the first choice for many data processing tasks, but its security and privacy implications have been barely investigated. In particular, he aims to address the challenges of model stealing and membership inference attacks on deep neural network models, along with further enhancing the efficiency and security of processing encrypted data.

  1. 2024 (64)
    1. July (7)
    2. June (11)
    3. May (15)
    4. April (9)
    5. March (13)
    6. February (1)
    7. January (8)
  2. 2023 (70)
    1. December (6)
    2. November (7)
    3. October (7)
    4. September (2)
    5. August (3)
    6. July (7)
    7. June (8)
    8. May (9)
    9. April (6)
    10. March (7)
    11. February (4)
    12. January (4)
  3. 2022 (63)
    1. December (2)
    2. November (7)
    3. October (6)
    4. September (6)
    5. August (1)
    6. July (3)
    7. June (7)
    8. May (8)
    9. April (7)
    10. March (6)
    11. February (6)
    12. January (4)
  4. 2021 (64)
  5. 2020 (73)
  6. 2019 (90)
  7. 2018 (82)
  8. 2017 (51)
  9. 2016 (27)
  10. 2015 (41)
  11. 2014 (32)
  12. 2013 (46)
  13. 2012 (17)
  14. 2011 (20)