| An efficient system for non-transferable anonymous credentials with optional anonymity revocation J Camenisch, A Lysyanskaya Advances in Cryptology—EUROCRYPT 2001: International Conference on the …, 2001 | 1848 | 2001 |
| Efficient group signature schemes for large groups J Camenisch, M Stadler Annual international cryptology conference, 410-424, 1997 | 1692 | 1997 |
| Direct anonymous attestation E Brickell, J Camenisch, L Chen Proceedings of the 11th ACM conference on Computer and communications …, 2004 | 1425 | 2004 |
| Signature schemes and anonymous credentials from bilinear maps J Camenisch, A Lysyanskaya Annual international cryptology conference, 56-72, 2004 | 1308 | 2004 |
| A practical and provably secure coalition-resistant group signature scheme G Ateniese, J Camenisch, M Joye, G Tsudik Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology …, 2000 | 1304 | 2000 |
| Dynamic accumulators and application to efficient revocation of anonymous credentials J Camenisch, A Lysyanskaya Advances in Cryptology—CRYPTO 2002: 22nd Annual International Cryptology …, 2002 | 1201 | 2002 |
| A signature scheme with efficient protocols J Camenisch, A Lysyanskaya Security in Communication Networks: Third International Conference, SCN 2002 …, 2003 | 1082 | 2003 |
| Design and implementation of the idemix anonymous credential system J Camenisch, E Van Herreweghen Proceedings of the 9th ACM Conference on Computer and Communications …, 2002 | 880 | 2002 |
| Practical verifiable encryption and decryption of discrete logarithms J Camenisch, V Shoup Annual International Cryptology Conference, 126-144, 2003 | 689 | 2003 |
| Compact e-cash J Camenisch, S Hohenberger, A Lysyanskaya Annual International Conference on the Theory and Applications of …, 2005 | 635 | 2005 |
| Blind signatures based on the discrete logarithm problem JL Camenisch, JM Piveteau, MA Stadler Advances in Cryptology—EUROCRYPT'94: Workshop on the Theory and Application …, 1995 | 506 | 1995 |
| Fair blind signatures M Stadler, JM Piveteau, J Camenisch Advances in Cryptology—EUROCRYPT’95: International Conference on the Theory …, 1995 | 464 | 1995 |
| Efficient and generalized group signatures J Camenisch International conference on the theory and applications of cryptographic …, 1997 | 453 | 1997 |
| Proving in zero-knowledge that a number is the product of two safe primes J Camenisch, M Michels Advances in Cryptology—EUROCRYPT’99: International Conference on the Theory …, 1999 | 436 | 1999 |
| Using a rules model to improve handling of personally identifiable information SB Adler, EF Bangerter, NHJ Brown, J Camenisch, AM Gilbert, G Karjoth, ... US Patent 7,069,427, 2006 | 420 | 2006 |
| Efficient protocols for set membership and range proofs J Camenisch, R Chaabouni, A Shelat International Conference on the Theory and Application of Cryptology and …, 2008 | 411 | 2008 |
| Randomizable proofs and delegatable anonymous credentials M Belenkiy, J Camenisch, M Chase, M Kohlweiss, A Lysyanskaya, ... Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009 | 404 | 2009 |
| An accumulator based on bilinear maps and efficient revocation for anonymous credentials J Camenisch, M Kohlweiss, C Soriente Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009 | 392 | 2009 |
| Digital payment systems with passive anonymity-revoking trustees J Camenisch, U Maurer, M Stadler Journal of Computer Security 5 (1), 69-89, 1997 | 368 | 1997 |
| Proof systems for general statements about discrete logarithms J Camenisch, M Stadler Technical Report/ETH Zurich, Department of Computer Science 260, 1997 | 365 | 1997 |
Gregory NevenChainlink LabsVerified email at smartcontract.com
