Paul is a cryptographer and computer security researcher, and is currently a professor of computer science at Carleton University in Ottawa, Ontario. He previously held a Canada Research Chair in authentication and computer security and is a Fellow of the Royal Society of Canada (FRSC). Along with Alfred Menezes and Scott Vanstone, Paul was a co-author of the Handbook of Applied Cryptography, and the author of Computer Security and the Internet. In 2000, he was awarded The J.W. Graham Medal in Computing Innovation, and a Fellow of the Association for Computing Machinery in 2016 for his "contributions to applied cryptography, authentication and computer security.

Craig is a Professor of Computer Science at Queensland University of Technology (QUT), who has a special focus on post-quantum cryptography and Zero Knowledge Proofs. He was previously a Principal Researcher at Microsoft Research at Redmond. Craig did his PhD at QUT from 2008 to 2012, and received a Fulbright Scholarship with UC Irvine from 2010 and 2011. In 2015, Craig published details of the FourQ elliptic curve, and which is one of the fastest curves around.

Kenny is a professor in the Department of Computer Science at ETH Zurich, where he leads the Applied Cryptography Group. He was previously a professor in the Information Security Group at Royal Holloway, University of London. He served as co-chair of the IRTF's research group on Cryptography, CFRG, from 2014 to 2019 and as the Editor-in-Chief for the Journal of Cryptography 2017 to 2020. He was elected as an IACR Fellow in 2017 and was the IACR Distinguished Lecturer in 2025. He obtained his PhD from Royal Holloway in 1993, and his Doctoral Supervisor was Fred Piper. Kenny has been awarded a number of awards for his research work, including the Applied Networking Research Prize from the IRTF in 2013 and the Award for Outstanding Research in Privacy Enhancing Technologies, for work with Mihir Bellare and Phil Rogaway on the Security of symmetric encryption against mass surveillance, a paper published at CRYPTO 2014.

Giuseppe is a Professor, Eminent Scholar in the Cybersecurity and CCI Faculty Fellow in the Department of Computer Science and the Department of Cyber Security Engineering at George Mason University. He has advanced many areas of research, including proxy re-encryption, anonymous communication, two-party computation, secure storage, and provable data possession.

His current work includes privacy-preserving machine learning and decentralised secure computing based on blockchain technology. He received the NSF CAREER Award for his research on privacy and security, and the Google Faculty Research Award, the IBM Faculty Award, and the IEEE CISTC Technical Recognition Award for his research on cloud security.

Giuseppe was a researcher at IBM Zurich Research lab (Switzerland) and a scientist at the Information Sciences Institute of the University of Southern California (USA), and worked briefly as a visiting professor at Microsoft in Redmond (USA).

He was the Farber Endowed Chair in Computer Science and Department Chair at Stevens Institute of Technology. He previously worked with Sapienza University of Rome (Italy) and was an Associate Professor at Johns Hopkins University (USA). Giuseppe is also one of the JHU Information Security Institute's founders.

Joos is a Professor Emeritus with the Department of Electrical Engineering at the Catholic University of Leuven, Belgium. He is one of the most impactful researchers in Computer Science in the World, including in areas of cryptography, secure data communications, data mining and complex systems. His work has led to many areas of impact, including supervising the creators of the Advanced Encryption Standard. He has also worked to simplify the computational complexity of support vector machines, and which involved using a least-squares approach for learning-based classifiers. He has also enhanced the theory behind singular-value decomposition by extending it to multilinear dimensions, which has addressed complex data-mining challenges. Joos is also an IEEE Life Fellow and served as the President of the Royal Flemish Academy of Belgium KVAB. He also co-wrote the book defining "The Invisible Power of Mathematics".

Jens is a Chief Scientist at Nexus, and works in many areas of cryptography including in pairing-based cryptography and Zero-knowledge Proofs (ZKPs). He was previously a Professor of Cryptology at University College, London, and as the Director of Research at DFINITY. In 2016, he published a classic paper of "On the size of pairing-based non-interactive arguments", and which defines a Zero Knowledge Proof based on pairing-based cryptography. This is now known as Groth16, and is used in many applications, including with Zcash and Tornado Cash. In 2021, he won an IACR Test of Time award for the "Simulation-sound NIZK proofs for a practical language and constant size group signature". Then, in 2023, he won the IACR Test of Time Award with Amit Sahai for the 2018 paper on "Efficient Non-Interactive Proof Systems for Bilinear Groups".

The YouTube version is here: https://www.youtube.com/watch?v=ooOYmDzoQj

Medium article: https://billatnapier.medium.com/groth16-and-proving-your-know-the-answer-to-x%C2%B2-2x-15-029f6db184d0

Daniele is a professor in the Computer Science and Engineering department at the University of California, San Diego and, in 2019, he was elected as a Fellow of the IACR. His main focus is on the foundations of lattice-based cryptography and its advanced applications, including fully homomorphic encryption. Overall, he has published many classic papers that relate to lattice methods, including working with Chris Peikert on "Trapdoors for lattices", and with Oded Regev on the "Worst-case to average-case reductions based on Gaussian methods". Daniele has also contributed greatly to the advancement of bootstrapping methods, including defining the DM/FHEW method - along with Leo Ducas.

He published a book on the "Complexity of Lattice Problems - A cryptographic perspective" with Shafi Goldwasser, and his paper on "Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions" was given a FOCS 20 years test of time award in 2022. This paper led to the theoretical foundation of efficient lattice based cryptography. His paper with Regev also received the FOCS ToT award in 2024.

Gene is a Distinguished and ICS Alumni Professor of Computer Science at the University of California, Irvine (UCI) where he has been since 2000. His research covers areas of security, privacy, and cryptography. From 1991 to 1996, he was a researcher at the IBM Zurich Research Laboratory and then at the Information Science Institute until 2000. He is a Fulbright scholar and a Fellow of the ACM, IEEE, AAAS, and IFIP. From 2009 to 2015, he was the editor-in-chief of the ACM Transactions on Privacy and Security (TOPS). Over the years, Gene has received a number of awards, including the ACM SIGSAC Outstanding Contribution Award, the 2020 IFIP Jean-Claude Laprie Award, the 2023 ACM SIGSAC Outstanding Innovation Award, and a 2025 Guggenheim Fellowship.

Google Scholar: https://scholar.google.co.uk/citations?user=WLvuu74AAAAJ&hl=en&oi=ao