A calculus for cryptographic protocols
Information and Computation
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Communication and Concurrency
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Uniform Approach for the Definition of Security Properties
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Honest Ideals on Strand Spaces
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Fast, automatic checking of security protocols
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Verification of security protocols using LOTOS-method and application
Computer Communications
A Uniform Framework for Security and Trust Modeling and Analysis with Crypto-CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal analysis of an electronic voting system: An experience report
Journal of Systems and Software
Towards an integrated formal analysis for security and trust
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
| Hi-index | 0.00 |
Crypto-CCS is a formal description language for distributed protocols which is suitable to abstractly model the cryptographic ones. Indeed, this language adopts a message-manipulating rule which may be used to mimic some features of cryptographic functions. We equip the Crypto-CCS calculus with a symbolic operational semantics. Moreover, we provide a mechanized method to analyze the security properties of cryptographic protocols (with finite behaviour), symbolically. Our work extends the previous one on symbolic verification techniques for cryptographic protocols modeled with process algebras since it deals with (almost) generic inference systems instead of fixed ones.