Informatik - Johannes Blömer (Universität Paderborn)

Education and Academic Career
Since 2009	Professor (W3) Paderborn University, Germany
2000 - 2009	Associate Professor (C3) Paderborn University, GermanyPaderborn University, Germany
1996 - 2000	Postdoc ETH Zurich, Switzerland
01.10.1997 - 31.03.1998	Visiting Professor Goethe University Frankfurt am Main, Substitute Professor for Prof. Dr. C.-P. Schnorr
1993 - 1996	Postdoc International Computer Science Institute, Berkeley, USA, supported by grants from NSF (USA) and from the EUInternational Computer Science Institute, Berkeley, USA, supported by grants from NSF (USA) and from the EU
29.01.1993	Doctorate Supervisor: Prof. Dr. Helmut Alt, Computer Science, Free University Berlin, Germany. Supervisor: Prof. Dr. Chee-Keng Yap, Computer Science, New York University, USA
1983 - 1989	Degree programme Diploma in Mathematics, Free University Berlin, Germany
Awards und Fellowships
2000 - 2008	Papers selected for special issues of ESA 2000, ICALP 2007, SODA 2008
2003	Weierstraß-Prize for Excellence in Teaching, Faculty for Computer Science, Electrical Engineering and Mathematics, Paderborn University
1994 - 1996	Habilitation scholarship, German Science Foundation (DFG)
Miscellaneous
Since 2019	Chair of Tenure Board, Paderborn University
Since 2018	Vice-President for Research and Junior Academics, Paderborn University
Since 2014	Member of the selection committee for the International Graduate School Scholarship Programme of the German Academic Exchange Service
Since 1993	Journal Referee: SIAM Journal on Computing, IEEE Transactions on Information Theory, ACM Transactions on Algorithms, Computational Complexity, Theoretical Computer Science
2009 - 2015	Member of the Senate, Paderborn University
2007 - 2009	Head of Department of Computer Science, Paderborn University
Scientific Engagement
Organisation of Scientific Events
2023	Organizing Committee International Colloquium on Automata, Languages and Programming, ICALP
2017 - 2019	Steering Committee Mathematical Aspects of Computer and Information Science (MACIS)
2017	Program Committee Chair Mathematical Aspects of Computer and Information Science (MACIS 2017)
2007	Organiser of the Dagstuhl Seminar Cryptography (with Dan Boneh, Stanford, Ronald Cramer, CWI Amsterdam, Ueli Maurer, ETH Zurich)
Engagement in Scientific Organisations
Since 2022	Initiator and Founding Director of the Jenny Aloni Center for Early-Career Researchers, Paderborn University
Since 2015	Liaison Professor of Fulbright Germany
Since 2014	Liaison Professor of the German Academic Scholarship Foundation
Editorial Boards and Editorship
Since 2023	Editorial Board member, Acta Informatica
Since 1993	Program committee and reviewer for various international conferences: STACS, ICALP, Crypto, Eurocrypt, SODA, STOC, FOCS etc.
Membership in Scientific Societies
Since 2018	Founding member and member of the Board of Directors of the Institute for Photonic Quantum Systems (PhoQS), Paderborn University

Since 2023	Editorial Board member, Acta Informatica Editorial Boards and Editorship
Since 2022	Initiator and Founding Director of the Jenny Aloni Center for Early-Career Researchers, Paderborn University Engagement in Scientific Organisations
Since 2019	Chair of Tenure Board, Paderborn University
Since 2018	Founding member and member of the Board of Directors of the Institute for Photonic Quantum Systems (PhoQS), Paderborn University Membership in Scientific Societies
Since 2018	Vice-President for Research and Junior Academics, Paderborn University
Since 2015	Liaison Professor of Fulbright Germany Engagement in Scientific Organisations
Since 2014	Member of the selection committee for the International Graduate School Scholarship Programme of the German Academic Exchange Service
Since 2014	Liaison Professor of the German Academic Scholarship Foundation Engagement in Scientific Organisations
Since 2009	Professor (W3) Paderborn University, Germany Education and Academic Career
Since 1993	Program committee and reviewer for various international conferences: STACS, ICALP, Crypto, Eurocrypt, SODA, STOC, FOCS etc. Editorial Boards and Editorship
Since 1993	Journal Referee: SIAM Journal on Computing, IEEE Transactions on Information Theory, ACM Transactions on Algorithms, Computational Complexity, Theoretical Computer Science
2023	Organizing Committee International Colloquium on Automata, Languages and Programming, ICALP Organisation of Scientific Events
2017 - 2019	Steering Committee Mathematical Aspects of Computer and Information Science (MACIS) Organisation of Scientific Events
2017	Program Committee Chair Mathematical Aspects of Computer and Information Science (MACIS 2017) Organisation of Scientific Events
2009 - 2015	Member of the Senate, Paderborn University
2007 - 2009	Head of Department of Computer Science, Paderborn University
2000 - 2009	Associate Professor (C3) Paderborn University, GermanyPaderborn University, Germany Education and Academic Career
2000 - 2008	Papers selected for special issues of ESA 2000, ICALP 2007, SODA 2008 Awards und Fellowships
2007	Organiser of the Dagstuhl Seminar Cryptography (with Dan Boneh, Stanford, Ronald Cramer, CWI Amsterdam, Ueli Maurer, ETH Zurich) Organisation of Scientific Events
2003	Weierstraß-Prize for Excellence in Teaching, Faculty for Computer Science, Electrical Engineering and Mathematics, Paderborn University Awards und Fellowships
1996 - 2000	Postdoc ETH Zurich, Switzerland Education and Academic Career
01.10.1997 - 31.03.1998	Visiting Professor Goethe University Frankfurt am Main, Substitute Professor for Prof. Dr. C.-P. Schnorr Education and Academic Career
1994 - 1996	Habilitation scholarship, German Science Foundation (DFG) Awards und Fellowships
1993 - 1996	Postdoc International Computer Science Institute, Berkeley, USA, supported by grants from NSF (USA) and from the EUInternational Computer Science Institute, Berkeley, USA, supported by grants from NSF (USA) and from the EU Education and Academic Career
29.01.1993	Doctorate Supervisor: Prof. Dr. Helmut Alt, Computer Science, Free University Berlin, Germany. Supervisor: Prof. Dr. Chee-Keng Yap, Computer Science, New York University, USA Education and Academic Career
1983 - 1989	Degree programme Diploma in Mathematics, Free University Berlin, Germany Education and Academic Career

Publications

Latest Publications

Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain

S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.

Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems

J. Blömer, J. Bobolz, F. Eidens, T. Jager, P. Kramer, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 237–246.

DOI PDF

Robustness and Security

J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 145–164.

DOI PDF

On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC

J. Blömer, J. Bobolz, H. Bröcher, in: 2023.

A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices

J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.

Show all publications

Research

Thematic Priorities

Projects

Publications

A Complexity Theoretical Study of Fuzzy K-Means

J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25.

DOI

A Generalized Wiener Attack on RSA

J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.

DOI

A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices

J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.

A lower bound for a class of graph based loss resilient codes

J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).

A new CRT-RSA algorithm secure against bellcore attacks

J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03, ACM Press, 2004.

DOI

A Practical Second-Order Fault Attack against a Real-World Pairing Implementation

J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.

DOI

A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers

J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.

DOI

A Theoretical Analysis of the Fuzzy K-Means Problem

J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–810.

DOI

A Theoretical and Experimental Comparison of the EM and SEM Algorithm

J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on Pattern Recognition, IEEE, 2014.

DOI

A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers

J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.

DOI

Adaptive Seeding for Gaussian Mixture Models

J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.

DOI

Adaptive Seeding for Gaussian Mixture Models

J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.

DOI

An XOR-based erasure-resilient coding scheme

J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.

Analysis of Agglomerative Clustering

M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).

DOI

Analysis of Countermeasures Against Access Driven Cache Attacks on AES

J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.

DOI

Anonymous and Publicly Linkable Reputation Systems

J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.

DOI

Approximate matching of polygonal shapes

H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).

Approximate matching of polygonal shapes (extended abstract)

H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91, ACM Press, 1991.

DOI

Approximation of convex polygons

H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.

DOI

Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations

J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.

DOI PDF

Bregman Clustering for Separable Instances

M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.

DOI

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices

J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.

DOI

Cloud Architectures for Searchable Encryption

J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.

DOI

Clustering for Metric and Nonmetric Distance Measures

M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.

DOI

Computing sums of radicals in polynomial time

J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.

DOI

Computing sums of radicals in polynomial time

J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.

DOI

Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions

J. Blömer, G. Liske, (2014).

Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes

J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.

DOI

Coresets and Approximate Clustering for Bregman Divergences

M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.

DOI

Coresets for Fuzzy K-Means with Applications

J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.

DOI

Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures

J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography & Network Security, n.d.

DOI

Denesting by bounded degree radicals

J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.

DOI

Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain

S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.

Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles

J. Blömer, G. Liske, (2013).

Dynamic Searchable Encryption with Access Control

J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019.

Effizienz und Sicherheit paarungsbasierter Kryptographie

J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.

Engineering self-coordinating software intensive systems

W. Schäfer, A. Trächtler, M. Birattari, J. Blömer, M. Dorigo, G. Engels, R. O’Grady, M. Platzner, F. Rammig, W. Reif, in: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010.

DOI

Enhanced Security of Attribute-Based Signatures

J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology And Network Security (CANS), Springer, 2018, pp. 235–255.

DOI

Fault Based Collision Attacks on AES

J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.

DOI

Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)

J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.

DOI

Fully-Featured Anonymous Credentials with Reputation System

K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.

DOI https://github.com/upbcuk

Hard-Clustering with Gaussian Mixture Models

J. Blömer, S. Brauer, K. Bujna, (2016).

Hardness and Non-Approximability of Bregman Clustering Problems.

M.R. Ackermann, J. Blömer, C. Scholz, (2011).

How to denest Ramanujan's nested radicals

J. Blömer, in: Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992.

DOI

How to Share a Secret

J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168.

DOI

How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models

J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.

DOI

Improved Side Channel Attacks on Pairing Based Cryptography

J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.

DOI

Key Revocation with Interval Cover Families

J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.

DOI

Low Secret Exponent RSA Revisited

J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.

DOI

New Partial Key Exposure Attacks on RSA

J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.

DOI

On the complexity of computing short linearly independent vectors and short bases in a lattice

J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99, ACM Press, 1999.

DOI

On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC

J. Blömer, J. Bobolz, H. Bröcher, in: 2023.

On the initialization of dynamic models for speech features

A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, J. Blömer, Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany (2010).

Personal Cross-Platform Reputation

J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.

DOI PDF

Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems

DOI PDF

Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems

J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.

DOI

Priority encoding transmission

A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744.

DOI

Priority encoding transmission

A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.

DOI

Provably Anonymous Communication Based on Trusted Execution Environments

J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.

Provably Secure Masking of AES

J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.

DOI

Randomness and Secrecy - A Brief Introduction

J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.

DOI

Resemblance and symmetries of geometric patterns

H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.

DOI

Robustness and Security

DOI PDF

Sampling methods for shortest vectors, closest vectors and successive minima

J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.

DOI

Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study

J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.

Short Group Signatures with Distributed Traceability

J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.

DOI

Sign Change Fault Attacks on Elliptic Curve Cryptosystems

J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.

DOI

Simplifying Expressions Involving Radicals

J. Blömer, Simplifying Expressions Involving Radicals, PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.

Singular Curve Point Decompression Attack

J. Blömer, P. Günther, in: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016.

DOI

Solving the Closest Vector Problem with respect to Lp Norms

J. Blömer, S. Naewe, ArXiv:1104.3720 (2011).

Subtleties in Security Definitions for Predicate Encryption with Public Index

J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453.

DOI

Tampering attacks in pairing-based cryptography

J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.

DOI

The rank of sparse random matrices over finite fields

J. Blömer, R. Karp, E. Welzl, Random Structures \& Algorithms (1997) 407–419.

DOI

Theoretical Analysis of the k-Means Algorithm – A Survey

J. Blömer, C. Lammersen, M. Schmidt, C. Sohler, in: Algorithm Engineering, Springer International Publishing, Cham, 2016, pp. 81–116.

DOI

Turing und Kryptografie

J. Blömer, Informatik-Spektrum 35 (2012).

DOI

Updatable Anonymous Credentials and Applications to Incentive Systems

J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.

DOI

Voronoi Cells of Lattices with Respect to Arbitrary Norms

J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.

DOI

Voronoi Cells of Lattices with Respect to Arbitrary Norms

J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015.

Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered

J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.

DOI

Show all publications

Prof. Dr. Johannes Blömer

Education and Academic Career

Awards und Fellowships

Miscellaneous

Scientific Engagement

Organisation of Scientific Events

Engagement in Scientific Organisations

Editorial Boards and Editorship

Membership in Scientific Societies

Latest Publications

Research

Thematic Priorities

Projects

Publications