Dynamic analysis of security protocols
Proceedings of the 2000 workshop on New security paradigms
An environment for security protocol intrusion detection
Journal of Computer Security
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
A HOL extension of GNY for automatically analyzing cryptographic protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
A Tool for Lazy Verification of Security Protocols
Proceedings of the 16th IEEE international conference on Automated software engineering
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
A Method for Patching Interleaving-Replay Attacks in Faulty Security Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling and Verifying Time Sensitive Security Protocols with Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure Time Synchronization in Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
Constraint Abstraction in Verification of Security Protocols
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Attacks and improvements to an RIFD mutual authentication protocol and its extensions
Proceedings of the second ACM conference on Wireless network security
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Non-repudiation analysis using LySa with annotations
Computer Languages, Systems and Structures
Proceedings of the fourth ACM conference on Wireless network security
Practical property-based attestation on mobile devices
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Towards user-friendly credential transfer on open credential platforms
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
AmazonIA: when elasticity snaps back
Proceedings of the 18th ACM conference on Computer and communications security
Honoring Carolyn Talcott's contributions to science
Formal modeling
From security protocols to systems security
Proceedings of the 11th international conference on Security Protocols
A survey of security issues in hardware virtualization
ACM Computing Surveys (CSUR)
Lattice-based completely non-malleable public-key encryption in the standard model
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Recently, the use of public key encryption to provide secure network communication has received considerable attention. Such public key systems are usually effective against passive eavesdroppers, who merely tap the lines and try to decipher the message. It has been pointed out, however, that an improperly designed protocol could be vulnerable to an active saboteur, one who may impersonate another user or alter the message being transmitted. In this paper we formulate several models in which the security of protocols can be discussed precisely. Algorithms and characterizations that can be used to determine protocol security in these models will be given.