Proceedings of CRYPTO 84 on Advances in cryptology
Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Finite-state analysis of two contract signing protocols
Theoretical Computer Science
A Multi-party Optimistic Non-repudiation Protocol
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
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
Analyzing the Needham-Schroeder Public-Key Protocol: A Comparison of Two Approaches
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Analysis of Abuse-Free Contract Signing
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Some Remarks on a Fair Exchange Protocol
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An Efficient Non-repudiation Protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Generic non-repudiation protocols supporting transparent off-line TTP
Journal of Computer Security - On IWAP'05
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
ATL* Satisfiability Is 2EXPTIME-Complete
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Generic Fair Non-Repudiation Protocols with Transparent Off-line TTP
Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Distributed synthesis for alternating-time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Computationally sound analysis of a probabilistic contract signing protocol
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Strategic planning for probabilistic games with incomplete information
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
ACM Transactions on Computational Logic (TOCL)
A new method for formalizing optimistic fair exchange protocols
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Verification of A Key Chain Based TTP Transparent CEM Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Satisfiability and finite model property for the alternating-time µ-calculus
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Proving ATL* properties of infinite-state systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A new algorithm for strategy synthesis in LTL games
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Selective approaches for solving weak games
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
A formal analysis of fairness and non-repudiation in the RSA-CEGD protocol
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Synthesizing protocols for digital contract signing
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Automatic verification of competitive stochastic systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Game-based verification of contract signing protocols with minimal messages
Innovations in Systems and Software Engineering
Fairness in non-repudiation protocols
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Alternating-Time temporal logic in the calculus of (co)inductive constructions
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
| Hi-index | 0.01 |
In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. This method is automated by using the model-checker MOCHA, a model-checker that supports the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using MOCHA.