Camenisch, Jan - IBM Zurich Research Laboratory

• Proving in ZeroKnowledge that a Number is the Product of Two Safe Primes
• Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
• Protecting (Anonymous) Credentials with the Trusted Computing Group's TPM V1.2
• A General Certification Framework with Applications to Privacy-Enhancing Certificate Infrastructures
• Anonymous yet Accountable Access Control Michael Backes
• A Formal Treatment of Onion Routing Jan Camenisch
• Compact E-Cash Jan Camenisch
• Direct Anonymous Attestation Ernie Brickell
• Better Privacy for Trusted Computing Platforms (Extended Abstract)
• A Cryptographic Framework for the Controlled Release Of Certified Data
• Design and Implementation of the idemix Anonymous Credential System
• An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
• Confirmer Signature Schemes Secure against Adaptive Adversaries
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
• Verifiable Encryption, Group Encryption, and their Applications to Separable Group Signatures and Signature Sharing Schemes
• Cryptographic Security for Mobile Code Joy Algesheimer Christian Cachin Jan Camenisch Gunter Karjoth
• Privacy and Identity Management for Everyone Jan Camenisch
• Signature Schemes and Anonymous Credentials from Bilinear Maps
• Optimistic Fair Secure Computation Christian Cachin Jan Camenisch
• Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
• A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
• An Identity Escrow Scheme with Appointed Jan Camenisch
• Fine-Grained Forward-Secure Signature Schemes without Random Oracles
• A Note about Group Signature Schemes Based on the Assumption v e = a x + 1 (mod n)
• Separability and Eciency for Generic Group Signature Schemes
• Group Signatures: Better Efficiency and New Theoretical Aspects
• Efficient Proofs Of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
• Efficient Anonymous Fingerprinting with Group Signatures
• Practical Verifiable Encryption and Decryption of Discrete Jan Camenisch
• A Signature Scheme with Efficient Protocols Jan Camenisch
• Efficient Blind Signatures without Random Jan Camenisch
• HartungGorre Information
• Veri able Encryption, Group Encryption, and their Applications to Separable Group Signatures and Signature Sharing Schemes
• Separability and Efficiency for Generic Group Signature Schemes
• Ecient Anonymous Fingerprinting with Group Signatures
• Con rmer Signature Schemes Secure against Adaptive Adversaries