World's Best Scientists 2026 revealed!
Jan Camenisch

Jan Camenisch

Award Badge
Computer Science
Switzerland
2025

D-Index & Metrics

Computer Science

D-Index
75
Citations
29329
World Ranking
1386
National Ranking
34

Research.com Recognitions

  • 2025 - Research.com Computer Science in Switzerland Leader Award
  • 2022 - Research.com Computer Science in Switzerland Leader Award
  • 2018 - ACM Fellow For contributions to privacy-enhancing cryptographic protocols and leadership in their practical realization
  • 2013 - Edward J. McCluskey Technical Achievement Award, IEEE Computer Society For pioneering theoretical work on privacy-enhancing cryptographic protocols and leadership in their practical realization

Overview

Jan Camenisch is affiliated with DFINITY in Switzerland and has contributed primarily to research in the fields of Computer Science and Mathematics. Their work spans several subfields, most notably Artificial Intelligence, Information Systems, and Geometry and Topology.

The main topics covered in their research include:

  • Cryptography and Data Security
  • Privacy-Preserving Technologies in Data
  • Cloud Data Security Solutions
  • Cryptographic Implementations and Security
  • Geometric and Algebraic Topology

Jan Camenisch has collaborated frequently with several researchers, including:

  • Manu Drijvers
  • Anja Lehmann
  • Gregory Neven
  • Patrick Towa
  • Cecilia Boschini

Though specific recent papers are not listed, Jan Camenisch's contributions to privacy-enhancing cryptographic protocols and their practical implementation are recognized in their career.

Jan Camenisch has been acknowledged through awards such as the ACM Fellow in 2018, cited for contributions to privacy-enhancing cryptographic protocols and leadership in practical realization. Earlier, in 2013, they received the Edward J. McCluskey Technical Achievement Award from the IEEE Computer Society, recognizing pioneering theoretical work on privacy-enhancing cryptographic protocols and related leadership.

Best Publications

  • Dynamic accumulators and application to efficient revocation of anonymous credentials

    Jan Camenisch;Anna Lysyanskaya

  • An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.

    Jan Camenisch;Anna Lysyanskaya

  • Efficient Group Signature Schemes for Large Groups (Extended Abstract)

    Jan Camenisch;Markus Stadler

  • Direct anonymous attestation

    Ernie Brickell;Jan Camenisch;Liqun Chen

  • A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

    Giuseppe Ateniese;Jan Camenisch;Marc Joye;Gene Tsudik

  • A signature scheme with efficient protocols

    Jan Camenisch;Anna Lysyanskaya

  • Signature schemes and anonymous credentials from bilinear maps

    Jan Camenisch;Anna Lysyanskaya

  • Efficient group signature schemes for large groups

    J. Camenisch;M. Stadler

  • Design and implementation of the idemix anonymous credential system

    Jan Camenisch;Els Van Herreweghen

  • Practical Verifiable Encryption and Decryption of Discrete Logarithms

    Jan Camenisch;Victor Shoup

  • Compact E-Cash.

    Jan Camenisch;Susan Hohenberger;Anna Lysyanskaya

  • Digital payment systems with passive anonymity-revoking trustees

    Jan Camenisch;Ueli Maurer;Markus Stadler

  • Blind signatures based on the discrete logarithm problem

    Jan L. Camenisch;Jean-Marc Piveteau;Markus A. Stadler

  • Fair blind signatures

    Markus Stadler;Jean-Marc Piveteau;Jan Camenisch

  • Efficient and generalized group signatures

    Jan Camenisch

  • Proving in zero-knowledge that a number is the product of two safe primes

    Jan Camenisch;Markus Michels

  • Efficient Protocols for Set Membership and Range Proofs

    Jan Camenisch;Rafik Chaabouni;Abhi Shelat

  • An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

    Jan Camenisch;Markulf Kohlweiss;Claudio Soriente

  • Randomizable Proofs and Delegatable Anonymous Credentials

    Mira Belenkiy;Jan Camenisch;Melissa Chase;Markulf Kohlweiss

  • How to win the clonewars: efficient periodic n-times anonymous authentication

    Jan Camenisch;Susan Hohenberger;Markulf Kohlweiss;Anna Lysyanskaya

  • A Group Signature Scheme with Improved Efficiency

    Jan Camenisch;Markus Michels

Frequent Co-Authors

Anna Lysyanskaya
Anna Lysyanskaya Brown University
Markulf Kohlweiss
Markulf Kohlweiss University of Edinburgh
Victor Shoup
Victor Shoup New York University
Susan Hohenberger
Susan Hohenberger Johns Hopkins University
Abhi Shelat
Abhi Shelat Northeastern University
Christian Cachin
Christian Cachin University of Bern
Michael Waidner
Michael Waidner Technical University of Darmstadt
Liqun Chen
Liqun Chen University of Surrey
Giuseppe Ateniese
Giuseppe Ateniese George Mason University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a Computer Science degree opens doors to many specialized online programs and in-demand career paths. For students interested in big data, analytics, or AI, pursuing an online masters for data science can offer advanced knowledge and significant career benefits.

If you’re considering a broader range of roles in technology or engineering, you might want to look at the best 2 year construction management degree online options. Programs like these combine tech skills with project management, preparing graduates for leadership roles.

For those interested in business and technology integration, the cheapest online mba programs can be an ideal way to combine computing expertise with management skills, all from the flexibility of home.

Finally, busy professionals should consider flexible degree formats such as an online masters degree that can be completed in a year. These accelerated pathways help students quickly gain new credentials and move ahead in their careers.

Best Scientists Citing Jan Camenisch

Trending Scientists