Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
A Calculus for Secure Channel Establishment in Open Networks
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
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
The domino effect of password reuse
Communications of the ACM - Human-computer etiquette
Password Memorability and Security: Empirical Results
IEEE Security and Privacy
Anonymous yet accountable access control
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
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
Get shorty via group signatures without encryption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
A formal model of identity mixer
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Digital privacy
Constructive cryptography --- a new paradigm for security definitions and proofs
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Confidentiality and integrity: a constructive perspective
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
| Hi-index | 0.00 |
Establishing authentic channels has become a common operation on the Internet and electronic commerce would not be possible without it. Because traditionally authentication is based on identifying users, the success of electronic commerce causes rapid erosion of their privacy. Privacy-friendly authentication, such as group signatures or anonymous credential systems, could mitigate this issue minimizing the information released during an authentication operation. Unfortunately, privacy-friendly authentication systems are not yet deployed. One reason is their sophistication and feature richness, which is complicating their understanding. By providing a calculus for analyzing and comparing the requirements and goals of privacy-friendly authentication systems, we contribute to a better understanding of such technologies. Our calculus extends the one by Maurer and Schmid [18], by introducing: (1) pseudonyms to enable pseudonymous authentication, (2) a pseudonym annotation function denoting the information an entity reveals about itself, and (3) event-based channel conditions to model conditional release of information used for privacy-friendly accountability.