| Efficient group signature schemes for large groups J Camenisch, M Stadler Annual International Cryptology Conference, 410-424, 1997 | 1496 | 1997 |
| An efficient system for non-transferable anonymous credentials with optional anonymity revocation J Camenisch, A Lysyanskaya International conference on the theory and applications of cryptographic …, 2001 | 1407 | 2001 |
| A practical and provably secure coalition-resistant group signature scheme G Ateniese, J Camenisch, M Joye, G Tsudik Annual International Cryptology Conference, 255-270, 2000 | 1203 | 2000 |
| Direct anonymous attestation E Brickell, J Camenisch, L Chen Proceedings of the 11th ACM conference on Computer and communications …, 2004 | 1140 | 2004 |
| Signature schemes and anonymous credentials from bilinear maps J Camenisch, A Lysyanskaya Annual International Cryptology Conference, 56-72, 2004 | 988 | 2004 |
| Dynamic accumulators and application to efficient revocation of anonymous credentials J Camenisch, A Lysyanskaya Annual International Cryptology Conference, 61-76, 2002 | 886 | 2002 |
| A signature scheme with efficient protocols J Camenisch, A Lysyanskaya International Conference on Security in Communication Networks, 268-289, 2002 | 818 | 2002 |
| 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 | 691 | 2002 |
| Practical verifiable encryption and decryption of discrete logarithms J Camenisch, V Shoup Annual International Cryptology Conference, 126-144, 2003 | 581 | 2003 |
| Compact e-cash J Camenisch, S Hohenberger, A Lysyanskaya Annual International Conference on the Theory and Applications of …, 2005 | 492 | 2005 |
| Fair blind signatures M Stadler, JM Piveteau, J Camenisch International Conference on the Theory and Applications of Cryptographic …, 1995 | 418 | 1995 |
| Blind signatures based on the discrete logarithm problem JL Camenisch, JM Piveteau, MA Stadler Workshop on the Theory and Application of of Cryptographic Techniques, 428-432, 1994 | 418 | 1994 |
| Efficient and generalized group signatures J Camenisch International Conference on the Theory and Applications of Cryptographic …, 1997 | 413 | 1997 |
| Proving in zero-knowledge that a number is the product of two safe primes J Camenisch, M Michels International Conference on the Theory and Applications of Cryptographic …, 1999 | 377 | 1999 |
| Digital payment systems with passive anonymity-revoking trustees J Camenisch, U Maurer, M Stadler Journal of Computer Security 5 (1), 69-89, 1997 | 306 | 1997 |
| A group signature scheme with improved efficiency J Camenisch, M Michels International Conference on the Theory and Application of Cryptology and …, 1998 | 303 | 1998 |
| Randomizable proofs and delegatable anonymous credentials M Belenkiy, J Camenisch, M Chase, M Kohlweiss, A Lysyanskaya, ... Annual International Cryptology Conference, 108-125, 2009 | 293 | 2009 |
| How to win the clonewars: efficient periodic n-times anonymous authentication J Camenisch, S Hohenberger, M Kohlweiss, A Lysyanskaya, ... Proceedings of the 13th ACM conference on Computer and communications …, 2006 | 283 | 2006 |
| Group signatures: Better efficiency and new theoretical aspects J Camenisch, J Groth International Conference on Security in Communication Networks, 120-133, 2004 | 266 | 2004 |
| An accumulator based on bilinear maps and efficient revocation for anonymous credentials J Camenisch, M Kohlweiss, C Soriente International workshop on public key cryptography, 481-500, 2009 | 263 | 2009 |
Gregory NevenDFINITYVerified email at dfinity.org
