Fairness
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Fairness in electronic commerce
Fairness in electronic commerce
Finite-state analysis of two contract signing protocols
Theoretical Computer Science
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
How to Prevent Type Flaw Attacks on Security Protocols
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A Logic for Reasoning about Digital Rights
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Defining Liveness
Enabling DRM-Preserving Digital Content Redistribution
CEC '05 Proceedings of the Seventh IEEE International Conference on E-Commerce Technology
Constraint solving for contract-signing protocols
CONCUR 2005 - Concurrency Theory
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
Lessons from the Sony CD DRM episode
USENIX-SS'06 Proceedings of the 15th conference on USENIX Security Symposium - Volume 15
Computer-assisted verification of a protocol for certified email
SAS'03 Proceedings of the 10th international conference on Static analysis
Data access specification and the most powerful symbolic attacker in MSR
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
An intensive survey of fair non-repudiation protocols
Computer Communications
Formal methods for cryptographic protocol analysis: emerging issues and trends
IEEE Journal on Selected Areas in Communications
Distributed Partial Order Reduction for Security Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We formally specify the recent DRM scheme of Nair et al. in the µCRL process algebraic language. The security requirements of the scheme are formalized and using them as the basis, the scheme is verified. The verification shows the presence of security weaknesses in the original protocols, which are then addressed in our proposed extension to the scheme. A finite model of the extended scheme is subsequently model checked and shown to satisfy its design requirements, including secrecy, fairness and resisting content masquerading. Our analysis was distributed over a cluster of machines, allowing us to check the whole extended scheme despite its complexity and high non-determinacy.