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
Jan Camenisch focuses on Computer security, Theoretical computer science, Ring signature, Group signature and Cryptography. His research in Encryption, Random oracle, Authentication, Cryptographic protocol and Credential are components of Computer security. Jan Camenisch combines subjects such as Access structure, Proof of knowledge and Public-key cryptography with his study of Theoretical computer science.
His Ring signature research includes elements of Signature, Schnorr signature, Blind signature and Commitment scheme. The various areas that Jan Camenisch examines in his Group signature study include Discrete logarithm and Group. His Cryptography research includes themes of Trusted third party and Key size.
His main research concerns Computer security, Cryptography, Encryption, Theoretical computer science and Credential. His study in Computer security is interdisciplinary in nature, drawing from both Revocation and Internet privacy. His studies deal with areas such as Cryptographic protocol, Mathematical proof, Group signature, Proof of knowledge and Scheme as well as Theoretical computer science.
His work deals with themes such as Discrete logarithm, Group and Ring signature, which intersect with Group signature. His Ring signature study combines topics in areas such as Random oracle and Schnorr signature, Blind signature. His Credential research incorporates themes from Security token and Set.
Jan Camenisch spends much of his time researching Encryption, Computer security, Computer network, Theoretical computer science and Cryptography. His Encryption study deals with Cryptographic primitive intersecting with Trusted third party and Dictionary attack. His study ties his expertise on Scheme together with the subject of Computer security.
In the field of Computer network, his study on Identifier, Server and Node overlaps with subjects such as Leakage. His research investigates the connection with Theoretical computer science and areas like Cryptographic protocol which intersect with concerns in Provable security, Verifiable secret sharing and Modular design. In his study, Message encoding and Homomorphic encryption is strongly linked to Signature, which falls under the umbrella field of Cryptography.
Computer security, Scheme, Cryptography, Theoretical computer science and Encryption are his primary areas of study. His research in the fields of Credential and Authentication overlaps with other disciplines such as Pseudonym. His Scheme study integrates concerns from other disciplines, such as Random oracle, Set and Ideal.
His Cryptography research is multidisciplinary, relying on both Signature, Mathematical proof, Host and Direct Anonymous Attestation. Jan Camenisch has included themes like Cryptographic protocol and Cryptographic primitive in his Encryption study. His biological study spans a wide range of topics, including Group signature, Public-key cryptography and Lattice.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Dynamic accumulators and application to efficient revocation of anonymous credentials
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2002)
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.
Jan Camenisch;Anna Lysyanskaya.
IACR Cryptology ePrint Archive (2001)
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
Jan Camenisch;Markus Stadler.
international cryptology conference (1997)
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
Giuseppe Ateniese;Jan Camenisch;Marc Joye;Gene Tsudik.
international cryptology conference (2000)
Direct anonymous attestation
Ernie Brickell;Jan Camenisch;Liqun Chen.
computer and communications security (2004)
A signature scheme with efficient protocols
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2003)
Signature schemes and anonymous credentials from bilinear maps
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2004)
Efficient group signature schemes for large groups
J. Camenisch;M. Stadler.
Lecture Notes in Computer Science (1997)
Design and implementation of the idemix anonymous credential system
Jan Camenisch;Els Van Herreweghen.
computer and communications security (2002)
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Jan Camenisch;Victor Shoup.
international cryptology conference (2003)
If you think any of the details on this page are incorrect, let us know.
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:
DFINITY
Brown University
University of Edinburgh
New York University
Johns Hopkins University
Northeastern University
University of Bern
Technical University of Darmstadt
University of Surrey
George Mason University
University of Paris-Saclay
Nagoya University
Doshisha University
Chinese Academy of Sciences
Universidade Federal de Minas Gerais
Roslin Institute
University of Massachusetts Amherst
Eötvös Loránd University
Sanofi (France)
Stanford University
Louis Stokes Cleveland VA Medical Center
University of Amsterdam
King's College London
Columbia University
University of Cape Town
Ruhr University Bochum