Authentication in distributed systems: theory and practice
ACM Transactions on Computer Systems (TOCS)
Untraceability in mobile networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Untraceable mobility or how to travel incognito
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on computer network security
Authentication primitives and their compilation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using encryption for authentication in large networks of computers
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Secure implementation of channel abstractions
Information and Computation
Efficient, DoS-resistant, secure key exchange for internet protocols
Proceedings of the 9th ACM conference on Computer and communications security
Security Weaknesses in Bluetooth
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Protocols Using Anonymous Connections: Mobile Applications
Proceedings of the 5th International Workshop on Security Protocols
MIXes in Mobile Communication Systems: Location Management with Privacy
Proceedings of the First International Workshop on Information Hiding
SKEME: a versatile secure key exchange mechanism for Internet
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
A semantics for web services authentication
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Timed model checking of security protocols
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Trust but verify: authorization for web services
SWS '04 Proceedings of the 2004 workshop on Secure web service
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Timed analysis of security protocols
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Knowledge Aware Bisimulation and Anonymity
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Control Flow Analysis for the Applied π--calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing Password Protocol Security Against Off-line Dictionary Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
A pure labeled transition semantics for the applied pi calculus
Information Sciences: an International Journal
Identity Escrow Protocol and Anonymity Analysis in the Applied Pi-Calculus
ACM Transactions on Information and System Security (TISSEC)
Analyzing iKP security in applied pi calculus
CIS'04 Proceedings of the First international conference on Computational and Information Science
SeVe: automatic tool for verification of security protocols
Frontiers of Computer Science in China
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Verifying privacy-type properties of electronic voting protocols: a taster
Towards Trustworthy Elections
| Hi-index | 0.00 |
We present the analysis of a protocol for private authentication in the applied pi calculus. We treat authenticity and secrecy properties of the protocol. Although such properties are fairly standard, their formulation in the applied pi calculus makes an original use of process equivalences. In addition, we treat identity-protection properties, which are a delicate concern in several recent protocol designs.