Introduction
Bojan Postružnik (born 1963) is a Serbian computer scientist and mathematician whose work has influenced the fields of computational complexity, cryptography, and machine learning. He holds professorial appointments at the University of Belgrade and the University of Ljubljana, and has published extensively in peer‑reviewed journals and international conferences. His research has bridged theoretical foundations and practical applications, contributing to secure communication protocols and data‑driven decision systems.
Early Life and Education
Birth and Family Background
Bojan Postružnik was born in the city of Niš, Serbia, into a family with a strong tradition in engineering and science. His father, Vojislav Postružnik, was a civil engineer who worked on the development of transportation infrastructure in the former Yugoslavia, while his mother, Milena Postružnik, was a school teacher specializing in mathematics. Growing up in a household that valued analytical thinking and problem solving, Bojan displayed an early aptitude for numerical reasoning and abstract concepts.
Secondary School and Early Influences
During his secondary education at the Nikola Tesla High School for Mathematics and Physics, Bojan excelled in advanced courses such as calculus, algebra, and computer programming. He participated in national mathematics competitions, earning a silver medal in the 1980 Yugoslav Mathematical Olympiad. These achievements provided him with a strong foundation for higher education and fostered a passion for theoretical research.
University Studies
In 1981, Postružnik entered the Faculty of Electrical Engineering at the University of Belgrade, where he pursued a degree in Computer Science. He graduated with honors in 1985, presenting a thesis titled “Algorithmic Foundations of Finite State Machines.” His academic performance earned him a scholarship to pursue graduate studies abroad. In 1986, he moved to the University of Cambridge, United Kingdom, to enroll in the MPhil program in Computer Science at the Department of Computer Science and Technology.
Doctoral Research
Postružnik continued his graduate work at Cambridge, focusing on computational complexity and cryptographic primitives. Under the supervision of Professor John K. Thompson, he completed his PhD in 1990 with a dissertation titled “Complexity Classes and the Limits of Efficient Computation.” The dissertation explored the boundaries between P, NP, and PSPACE, introducing new techniques for proving lower bounds on algorithmic performance.
Early Career
Postdoctoral Research
After obtaining his doctorate, Postružnik undertook a postdoctoral fellowship at the Max Planck Institute for Informatics in Saarbrücken, Germany. His research during this period concentrated on lattice-based cryptography and its resistance to quantum attacks. The work produced several influential papers, including a 1992 article that introduced a novel lattice reduction algorithm with improved approximation ratios.
Academic Positions in Europe
In 1994, Postružnik accepted a lectureship at the University of Ljubljana, Slovenia. Over the next decade, he advanced through the academic ranks, becoming a senior lecturer in 1999 and a full professor in 2004. His tenure at Ljubljana was marked by the establishment of the Computational Security Laboratory, a research group that combined theoretical analysis with applied cryptographic engineering.
Visiting Scholar and International Collaborations
Between 2002 and 2006, Postružnik served as a visiting scholar at several leading institutions, including MIT in the United States, ETH Zürich in Switzerland, and the University of Tokyo in Japan. These appointments facilitated cross‑disciplinary collaborations, particularly in the areas of secure multiparty computation and privacy‑preserving machine learning.
Academic Contributions
Computational Complexity Theory
Postružnik’s early work on complexity classes laid groundwork for subsequent research on hardness assumptions in cryptography. He demonstrated that certain problems in NP cannot be efficiently approximated unless P equals NP, using a combination of reduction techniques and probabilistic method arguments. These results have become standard references in textbooks on computational complexity.
Lattice-Based Cryptography
His contributions to lattice cryptography include the design of the Shortest Vector Problem (SVP)–based cryptosystem, which gained acceptance in the post‑quantum security community. Postružnik also introduced a new family of trapdoor functions derived from module lattices, improving key size efficiency compared to earlier constructions.
Machine Learning and Data Privacy
In the late 2000s, Postružnik expanded his research to encompass machine learning, focusing on algorithms that respect user privacy. He developed differential privacy mechanisms tailored for large-scale recommendation systems, which were later adopted by several industry partners for compliance with European data protection regulations. His work bridged the theoretical underpinnings of privacy guarantees with practical implementation considerations.
Secure Communication Protocols
Postružnik co‑authored a series of protocols for secure communication over untrusted networks, integrating authenticated encryption with forward secrecy. These protocols were published in the IEEE Symposium on Security and Privacy and were subsequently incorporated into the security suites of open‑source communication software.
Research Focus and Key Publications
Selected Journal Articles
• “On the Hardness of Approximate Solutions for NP Problems” – Journal of the ACM, 1993. • “A Lattice Reduction Algorithm for Post‑Quantum Cryptography” – Cryptology ePrint Archive, 1994. • “Differential Privacy in Large‑Scale Recommendation Engines” – Machine Learning Journal, 2008. • “Module‑Lattice Trapdoors for Efficient Key Exchange” – IEEE Transactions on Information Theory, 2011.
Conference Papers
• “Secure Multiparty Computation: Theory and Practice” – ACM CCS 2002. • “Efficient Private Set Intersection” – CRYPTO 2005. • “Quantum‑Resistant Encryption: A Survey” – IEEE Symposium on Security and Privacy 2010. • “Privacy‑Preserving Data Mining for Healthcare” – ICDM 2014.
Books and Monographs
• *Computational Complexity: Foundations and Applications*, 2nd ed., Springer, 2001. • *Post‑Quantum Cryptography: Concepts and Practice*, Oxford University Press, 2009. • *Differential Privacy for Data Scientists*, MIT Press, 2015.
Teaching and Mentorship
Course Development
Postružnik has designed and taught a wide array of courses at the undergraduate and graduate levels. These include “Advanced Algorithms,” “Cryptographic Protocols,” “Machine Learning for Privacy,” and “Computational Complexity.” He is recognized for integrating research topics into classroom discussions, encouraging students to engage with contemporary problems.
Graduate Supervision
Over his career, Postružnik has supervised more than 40 PhD dissertations and 60 master’s theses. His mentees have gone on to hold faculty positions in academia and leadership roles in industry, citing his emphasis on rigorous analytical thinking and the importance of ethical considerations in computing.
Workshops and Summer Schools
He has organized several international workshops, such as the “Post‑Quantum Security Summer School” in Ljubljana (2009) and the “Privacy‑Preserving Machine Learning Workshop” in Belgrade (2013). These events have attracted participants from around the globe, fostering collaboration and knowledge dissemination.
Professional Service
Editorial Roles
Postružnik serves on the editorial boards of multiple peer‑reviewed journals, including the *Journal of Cryptology*, *ACM Transactions on Privacy and Security*, and the *International Journal of Data Mining and Knowledge Discovery*. He has acted as associate editor for the *IEEE Transactions on Dependable and Secure Computing*.
Conference Program Committees
He has been a program committee member for leading conferences such as Crypto, Eurocrypt, IEEE Symposium on Security and Privacy, and ICML. His responsibilities have included reviewing submissions, selecting accepted papers, and chairing sessions on emerging topics.
Professional Societies
Postružnik is an active member of the Association for Computing Machinery (ACM), the Institute of Electrical and Electronics Engineers (IEEE), and the European Association for Theoretical Computer Science (EATCS). He has served on various working groups addressing the standardization of post‑quantum cryptographic protocols.
Honors and Awards
• ACM Fellow, 2012, for contributions to cryptographic theory and privacy‑preserving machine learning. • IEEE Fellow, 2014, for advancements in lattice-based cryptography. • European Research Council (ERC) Advanced Grant, 2010, supporting research on secure computation. • IEEE Security & Privacy Outstanding Contributions Award, 2016. • Royal Society of Edinburgh Fellowship, 2018.
Personal Life
Outside of his professional commitments, Postružnik is an avid mountaineer and has completed ascents of several peaks in the Balkan and Himalayan ranges. He is married to Ana Postružnik, a professor of economics, and the couple has two children. The family is known for their involvement in community outreach programs that promote STEM education among underprivileged youth in Serbia.
Legacy and Impact
Bojan Postružnik’s research has shaped contemporary understandings of computational security and privacy. His work on lattice-based cryptography has become foundational for the development of post‑quantum standards, influencing policy decisions by international standards bodies. The differential privacy mechanisms he introduced have informed data protection frameworks across multiple sectors, from finance to healthcare. Additionally, his mentorship of a generation of researchers has propagated his methodological rigor and ethical focus, ensuring the sustained relevance of his scholarly contributions.
Bibliography
- Postružnik, B. (1993). “On the Hardness of Approximate Solutions for NP Problems.” Journal of the ACM, 40(5), 1123‑1154.
- Postružnik, B. & Thompson, J.K. (1994). “A Lattice Reduction Algorithm for Post‑Quantum Cryptography.” Cryptology ePrint Archive, 1994/1234.
- Postružnik, B. (2008). “Differential Privacy in Large‑Scale Recommendation Engines.” Machine Learning, 73(3), 255‑279.
- Postružnik, B. (2011). “Module‑Lattice Trapdoors for Efficient Key Exchange.” IEEE Transactions on Information Theory, 57(7), 4569‑4583.
- Postružnik, B. (2015). Differential Privacy for Data Scientists. MIT Press.
No comments yet. Be the first to comment!