The SCEAS System
Navigation Menu

Search the dblp DataBase


Jan Camenisch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Camenisch
    Efficient Anonymous Fingerprinting with Group Signatures. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:415-428 [Conf]
  2. Jan Camenisch, Ivan Damgård
    Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:331-345 [Conf]
  3. Jan Camenisch, Markus Michels
    A Group Signature Scheme with Improved Efficiency. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1998, pp:160-174 [Conf]
  4. Ernest F. Brickell, Jan Camenisch, Liqun Chen
    Direct anonymous attestation. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2004, pp:132-145 [Conf]
  5. Giuseppe Ateniese, Jan Camenisch, Breno de Medeiros
    Untraceable RFID tags via insubvertible encryption. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2005, pp:92-101 [Conf]
  6. Jan Camenisch, Els Van Herreweghen
    Design and implementation of the idemix anonymous credential system. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2002, pp:21-30 [Conf]
  7. Jan Camenisch, Jean-Marc Piveteau, Markus Stadler
    An Efficient Fair Payment System. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1996, pp:88-94 [Conf]
  8. Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich
    How to win the clonewars: efficient periodic n-times anonymous authentication. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2006, pp:201-210 [Conf]
  9. Joy Algesheimer, Jan Camenisch, Victor Shoup
    Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:417-432 [Conf]
  10. Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik
    A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:255-270 [Conf]
  11. Jan Camenisch, Anna Lysyanskaya
    Signature Schemes and Anonymous Credentials from Bilinear Maps. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:56-72 [Conf]
  12. Jan Camenisch, Anna Lysyanskaya
    Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:61-76 [Conf]
  13. Jan Camenisch, Victor Shoup
    Practical Verifiable Encryption and Decryption of Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:126-144 [Conf]
  14. Jan Camenisch, Markus Stadler
    Efficient Group Signature Schemes for Large Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:410-424 [Conf]
  15. Jan Camenisch, Anna Lysyanskaya
    A Formal Treatment of Onion Routing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:169-187 [Conf]
  16. Jan Camenisch, Markus Michels
    Separability and Efficiency for Generic Group Signature Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:413-430 [Conf]
  17. Christian Cachin, Jan Camenisch
    Optimistic Fair Secure Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:93-111 [Conf]
  18. Jan Camenisch, Anna Lysyanskaya
    An Identity Escrow Scheme with Appointed Verifiers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:388-407 [Conf]
  19. Jan Camenisch, Abhi Shelat, Dieter Sommer, Simone Fischer-Hübner, Marit Hansen, Henry Krasemann, Gérard Lacoste, Ronald Leenes, Jimmy C. Tseng
    Privacy and identity management for everyone. [Citation Graph (0, 0)][DBLP]
    Digital Identity Management, 2005, pp:20-27 [Conf]
  20. Abhilasha Bhargav-Spantzel, Jan Camenisch, Thomas Gross, Dieter Sommer
    User centricity: a taxonomy and open issues. [Citation Graph (0, 0)][DBLP]
    Digital Identity Management, 2006, pp:1-10 [Conf]
  21. Jan Camenisch, Abhi Shelat, Dieter Sommer, Roger Zimmermann
    Securing user inputs for the web. [Citation Graph (0, 0)][DBLP]
    Digital Identity Management, 2006, pp:33-44 [Conf]
  22. Jan Camenisch, Ueli M. Maurer, Markus Stadler
    Digital Payment Systems with Passive Anonymity-Revoking Trustees. [Citation Graph (0, 0)][DBLP]
    ESORICS, 1996, pp:33-43 [Conf]
  23. Jan Camenisch, Jean-Marc Piveteau, Markus Stadler
    An Efficient Electronic Payment System Protecting Privacy. [Citation Graph (0, 0)][DBLP]
    ESORICS, 1994, pp:207-215 [Conf]
  24. Jan Camenisch
    Better Privacy for Trusted Computing Platforms: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESORICS, 2004, pp:73-88 [Conf]
  25. Jan Camenisch
    Efficient and Generalized Group Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1997, pp:465-479 [Conf]
  26. Jan Camenisch, Susan Hohenberger, Anna Lysyanskaya
    Compact E-Cash. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:302-321 [Conf]
  27. Jan Camenisch, Anna Lysyanskaya
    An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:93-118 [Conf]
  28. Jan Camenisch, Markus Michels
    Confirmer Signature Schemes Secure against Adaptive Adversaries. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:243-258 [Conf]
  29. Jan Camenisch, Markus Michels
    Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:107-122 [Conf]
  30. Jan Camenisch, Jean-Marc Piveteau, Markus Stadler
    Blind Signatures Based on the Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:428-432 [Conf]
  31. Markus Stadler, Jean-Marc Piveteau, Jan Camenisch
    Fair Blind Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1995, pp:209-219 [Conf]
  32. Jan Camenisch, Jean-Marc Piveteau, Markus Stadler
    Faire anonyme Zahlungssysteme. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1995, pp:254-265 [Conf]
  33. Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller
    One-Round Secure Computation and Secure Autonomous Mobile Agents. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:512-523 [Conf]
  34. Jan Camenisch, Anton Mityagin
    Mix-Network with Stronger Security. [Citation Graph (0, 0)][DBLP]
    Privacy Enhancing Technologies, 2005, pp:128-146 [Conf]
  35. Endre Bangerter, Jan Camenisch, Ueli M. Maurer
    Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2005, pp:154-171 [Conf]
  36. Jan Camenisch, Jens Groth
    Group Signatures: Better Efficiency and New Theoretical Aspects. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:120-133 [Conf]
  37. Jan Camenisch, Maciej Koprowski, Bogdan Warinschi
    Efficient Blind Signatures Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:134-148 [Conf]
  38. Jan Camenisch, Anna Lysyanskaya
    A Signature Scheme with Efficient Protocols. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:268-289 [Conf]
  39. Jan Camenisch, Susan Hohenberger, Anna Lysyanskaya
    Balancing Accountability and Privacy Using E-Cash (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SCN, 2006, pp:141-155 [Conf]
  40. Jan Camenisch
    Protecting (Anonymous) Credentials with the Trusted Computing Group's TPM V1.2. [Citation Graph (0, 0)][DBLP]
    SEC, 2006, pp:135-147 [Conf]
  41. Jan Camenisch
    Anonymous Credentials: Opportunities and Challenges. [Citation Graph (0, 0)][DBLP]
    SEC, 2006, pp:460- [Conf]
  42. Jan Camenisch, Dieter Sommer, Roger Zimmermann
    A General Certification Framework with Applications to Privacy-Enhancing Certificate Infrastructures. [Citation Graph (0, 0)][DBLP]
    SEC, 2006, pp:25-37 [Conf]
  43. Joy Algesheimer, Christian Cachin, Jan Camenisch, Günter Karjoth
    Cryptographic Security for Mobile Code. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2001, pp:2-11 [Conf]
  44. Jan Camenisch, Anna Lysyanskaya, Mira Meyerovich
    Endorsed E-Cash. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2007, pp:101-115 [Conf]
  45. Endre Bangerter, Jan Camenisch, Anna Lysyanskaya
    A Cryptographic Framework for the Controlled Release of Certified Data. [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 2004, pp:20-42 [Conf]
  46. Michael Backes, Jan Camenisch, Dieter Sommer
    Anonymous yet accountable access control. [Citation Graph (0, 0)][DBLP]
    WPES, 2005, pp:40-46 [Conf]
  47. Jan Camenisch, Maciej Koprowski
    Fine-grained forward-secure signature schemes without random oracles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:2, pp:175-188 [Journal]
  48. Jan Camenisch, Ueli M. Maurer, Markus Stadler
    Digital Payment Systems With Passive Anonymity-Revoking Trustees. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 1997, v:5, n:1, pp:69-90 [Journal]
  49. Jan Camenisch, Susan Hohenberger, Michael Østergaard Pedersen
    Batch Verification of Short Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:246-263 [Conf]
  50. Jan Camenisch, Gregory Neven, Abhi Shelat
    Simulatable Adaptive Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:573-590 [Conf]

  51. Efficient Protocols for Set Membership and Range Proofs. [Citation Graph (, )][DBLP]

  52. Efficient attributes for anonymous credentials. [Citation Graph (, )][DBLP]

  53. Oblivious transfer with access control. [Citation Graph (, )][DBLP]

  54. Anonymous credentials on a standard java card. [Citation Graph (, )][DBLP]

  55. Randomizable Proofs and Delegatable Anonymous Credentials. [Citation Graph (, )][DBLP]

  56. Credential Authenticated Identification and Key Exchange. [Citation Graph (, )][DBLP]

  57. Rethinking accountable privacy supporting services: extended abstract. [Citation Graph (, )][DBLP]

  58. A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks. [Citation Graph (, )][DBLP]

  59. On the Portability of Generalized Schnorr Proofs. [Citation Graph (, )][DBLP]

  60. Private Intersection of Certified Sets. [Citation Graph (, )][DBLP]

  61. Unlinkable Priced Oblivious Transfer with Rechargeable Wallets. [Citation Graph (, )][DBLP]

  62. Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data. [Citation Graph (, )][DBLP]

  63. An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. [Citation Graph (, )][DBLP]

  64. A card requirements language enabling privacy-preserving access control. [Citation Graph (, )][DBLP]

  65. Solving Revocation with Efficient Update of Anonymous Credentials. [Citation Graph (, )][DBLP]

  66. Get Shorty via Group Signatures without Encryption. [Citation Graph (, )][DBLP]

  67. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. [Citation Graph (, )][DBLP]

  68. Privacy-Enhancing Cryptography: From Theory into Practice. [Citation Graph (, )][DBLP]

  69. Enhancing privacy of federated identity management protocols: anonymous credentials in WS-security. [Citation Graph (, )][DBLP]

  70. A Formal Model of Identity Mixer. [Citation Graph (, )][DBLP]

Search in 0.006secs, Finished in 0.008secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002