Nuovo DRM Paradiso: Towards a Verified Fair DRM Scheme

  • M. Torabi Dashti
  • S. Krishnan Nair
  • H. L. Jonker
Conference paper

DOI: 10.1007/978-3-540-75698-9_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4767)
Cite this paper as:
Torabi Dashti M., Krishnan Nair S., Jonker H.L. (2007) Nuovo DRM Paradiso: Towards a Verified Fair DRM Scheme. In: Arbab F., Sirjani M. (eds) International Symposium on Fundamentals of Software Engineering. FSEN 2007. Lecture Notes in Computer Science, vol 4767. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • M. Torabi Dashti
    • 1
  • S. Krishnan Nair
    • 2
  • H. L. Jonker
    • 3
  1. 1.CWI Amsterdam 
  2. 2.Vrije Universiteit Amsterdam 
  3. 3.Technische Universiteit Eindhoven 

Personalised recommendations