Jan Camenisch
Artificial Intelligence · 1997–2012
A researcher in the Science corpus: 15 papers; trusts 41 researchers and is trusted by 119 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 78 citations into it; #2,684 of 36,961 by trust here, #4,126 by citations
- Information Systems — 30 citations into it; #576 of 9,233 by trust here, #1,159 by citations
- Computational Theory and Mathematics — 29 citations into it; #766 of 12,489 by trust here, #1,990 by citations
- Computer Networks and Communications — 27 citations into it; #3,669 of 9,996 by trust here, #2,940 by citations
- Computer Vision and Pattern Recognition — 15 citations into it
- Privacy & Security — 14 citations into it
- Sociology and Political Science — 10 citations into it
- Discrete Mathematics and Combinatorics — 7 citations into it
Whom Jan Camenisch trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Ronald Cramer
- Stefan Brands
- Torben P. Pedersen
- David Chaum
- Claus-Peter Schnorr
- Amos Fiat
- Fabrice Boudot
- Giuseppe Ateniese
- Ivan Bjerre Damgård
Who trusts Jan Camenisch overall
- Anna Lysyanskaya
- Tobias Jeske
- Jens Groth
- Man Ho Allen Au
- Ernie Brickell
- Susan Hohenberger
- Dan Boneh
- Markulf Kohlweiss
- Victor Shoup
- Foteini Baldimtsi
Papers from Jan Camenisch's perspective
Ordered by how strongly the researchers Jan Camenisch trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Short Signatures from the Weil Pairing
- Identity-Based Encryption from the Weil Pairing
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Probabilistic Encryption
Their papers
- Signature Schemes and Anonymous Credentials from Bilinear Maps (2004) — 1,099 citations
- A Signature Scheme with Efficient Protocols (2002) — 807 citations
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009) — 319 citations
- Practical Verifiable Encryption and Decryption of Discrete Logarithms (2003) — 597 citations
- Privacy-Oriented Cryptography (Dagstuhl Seminar 12381) (2012)
- Efficient Protocols for Set Membership and Range Proofs (2008) — 324 citations
- How to win the clonewars: efficient periodic n-times anonymous authentication (2006) — 310 citations
- Compact E-Cash (2005) — 485 citations
- Direct anonymous attestation (2004) — 1,033 citations
- Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials (2002) — 984 citations
- Design and implementation of the idemix anonymous credential system (2002) — 685 citations
- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation (2001) — 1,445 citations
- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme (2000) — 913 citations
- Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes (1998)
- Proof systems for general statements about discrete logarithms (1997)