Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
SAT-based model-checking for security protocols analysis
International Journal of Information Security
Breaking and fixing public-key Kerberos
Information and Computation
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Proceedings of the 15th ACM conference on Computer and communications security
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
Foundations of Security Analysis and Design V
Verifying Anonymous Credential Systems in Applied Pi Calculus
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
A card requirements language enabling privacy-preserving access control
Proceedings of the 15th ACM symposium on Access control models and technologies
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Relating two standard notions of secrecy
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A cryptographic framework for the controlled release of certified data (transcript of discussion)
SP'04 Proceedings of the 12th international conference on Security Protocols
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Automating security analysis: symbolic equivalence of constraint systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Analysis of revocation strategies for anonymous Idemix credentials
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
A calculus for privacy-friendly authentication
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
| Hi-index | 0.00 |
Identity Mixer is an anonymous credential system developed at IBM that allows users for instance to prove that they are over 18 years old without revealing their name or birthdate. This privacy-friendly technology is realized using zero-knowledge proofs. We describe a formal model of Identity Mixer that is well-suited for automated protocol verification tools in the spirit of black-box cryptography models.