A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A calculus for cryptographic protocols
Information and Computation
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
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
A cost-based framework for analysis of denial of service in networks
Journal of Computer Security
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Efficient, DoS-resistant, secure key exchange for internet protocols
Proceedings of the 9th ACM conference on Computer and communications security
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
From Secrecy to Authenticity in Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Just fast keying: Key agreement in a hostile internet
ACM Transactions on Information and System Security (TISSEC)
Abstraction and Refinement in Protocol Derivation
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Analyzing security protocols with secrecy types and logic programs
Journal of the ACM (JACM)
Automated Verification of Selected Equivalences for Security Protocols
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Computer-assisted verification of a protocol for certified email
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
A derivation system and compositional logic for security protocols
Journal of Computer Security
Analysis of the SSL 3.0 protocol
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Analysis of a Biometric Authentication Protocol for Signature Creation Application
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Verification of Security Protocols
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Models and Proofs of Protocol Security: A Progress Report
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Automatic verification of correspondences for security protocols
Journal of Computer Security
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
An executable model for security protocol JFKr
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
A pure labeled transition semantics for the applied pi calculus
Information Sciences: an International Journal
Modeling and analyzing security in the presence of compromising adversaries
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Towards automatic analysis of election verifiability properties
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Translating Pi-calculus into LOTOS NT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Revoke and let live: a secure key revocation api for cryptographic devices
Proceedings of the 2012 ACM conference on Computer and communications security
Lengths may break privacy: or how to check for equivalences with length
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
JFK is a recent, attractive protocol for fast key establishment as part of securing IP communication. In this paper, we formally analyze this protocol in the applied pi calculus (partly in terms of observational equivalences and partly with the assistance of an automatic protocol verifier). We treat JFK's core security properties and also other properties that are rarely articulated and rigorously studied, such as plausible deniability and resistance to denial-of-service attacks. In the course of this analysis, we found some ambiguities and minor problems, such as limitations in identity protection, but we mostly obtain positive results about JFK. For this purpose, we develop ideas and techniques that should be more generally useful in the specification and verification of security protocols.