Digital Rights Management

SHWETA BHANDARI
DEPARTMENT OF COMPUTER SCIENCE
LNMIIT
 2

What is DRM?

 Digital rights management (DRM) can be viewed as an attempt to provide “remote

control” over digital content.
 The required level of protection goes beyond securely delivering the bits since
restrictions on the use of the content must be maintained after it has been delivered.
 The buzzword for this is “persistent protection.”

DRM
 3

Example

 A digital book: A book can be securely delivered over the Internet using standard
cryptographic techniques.
 But if the recipient can save the book in an unrestricted form, he can easily redistribute a
perfect digital copy to a vast number of people.
 Publishers can forego the potentially lucrative sale of digital books over the Internet.
 Without robust DRM, owners of digital content have little choice other than to rely on
the honor system.

DRM
 4
Persistent Protection

Restrictions on use after delivery

 No copying
 Limited number of reads
 Time limits: Do not open until Diwali, etc.
 No forwarding
 etc.

DRM
 5

Is crypto the answer?

 Attacker’s goal is to recover the key

 In standard crypto scenario, attacker has
 Cipher Text, Some plaintext, side channel infor , etc.
 In DRM scenario, attacker has
 Everything including the key in the box.
 Crypto was not designed to solve DRM problems!

DRM
 6

Current state of DRM

 Security by obscurity (at best)

 A derogatory term in the security world
 Secret designs
 In violation of Kerckhoff’s Principle
 Is crypto the answer?
 “Whoever thinks his problem can be solved using cryptography,
doesn’t understand his problem and doesn’t understand
cryptography.” --- Attributed by Roger Needham and Butler
DRM
Lampson to each other
 7

Software- Based DRM

 Strong software based DRM are impossible

 We can’t really hide a secret in the software
 To do so, we need to preserve Software Reverse Engineering (SRE)
 User of the system with full privilege can break anti-SRE
protection
 Bottom Line: The killer attack on DRM is SRE.

DRM
 8

MediaSnap’s DRM system:

 Protects PDF documents and most of the same principles could be

applied to audio, video or any other digital media.
 Server Side: Secure Document Server (SDS)
 Client Side: PDF plugin (or reader)
 Security stuff…

DRM
 Protecting a document
The client side:
 an email interface, with a pull-down menu to select the desired level of persistent protection.
 The resulting email and attachments are encrypted using standard techniques and sent to a Secure Document
Server (SDS)
SDS:
 At SDS the recipient’s authentication information (password and/or certificate and/or biometric, etc.) is stored.
 The SDS applies the desired persistent protection to the document, including the appropriate authentication
information. The protected document is then sent from the SDS to the recipient.
Recipient:
 Upon receipt, a protected document must be opened with an Adobe PDF reader equipped with a MediaSnap PDF
plugin.
 The heart of the client-side DRM system lives in this PDF plugin.
 10

Protecting a document

Sender encrypt
persistent
protection

Recipient
SDS

DRM
 11

Security issues

 Server (SDS)
 Protect keys, authentication data, etc.
 Apply persistent protection
 Client (Reader/PDF plugin)
 Protect keys, authenticate, etc.
 Enforce persistent protection

DRM
 12
Document reader security

Tamper-resistance

Obscurity

DRM
 13

Obscurity

 Key management
 Authentication
 Caching (keys, authentication, etc.)
 Encryption and “scrambling”
 Key parts (data and code)
 Multiple keys

Obscurity can only slow down the attacker. The persistent attacker still wins!

DRM
 14
Other security features

 Module tamper checking (hashing)

 Must know what code is executing
 Anti-screen capture
 Prevents most obvious attacks on the document
 Watermarking
 In theory, can trace stolen content
 In practice, watermarking is disappointing!
 “Unique-ification” (Metamorphism)
 Break once, break everywhere (BOBE) resistant
 Code “fragilization”
 Code hash checks itself, any change should cause code to break
 OS issues

DRM
 15

Conclusions

 Current DRM systems are weak

 Ideal software-based DRM features…
 Individual content is non-trivial to attack
 Overall system survives repeated attacks
 Is this possible?

DRM
Trusted Platform Module

SHWETA BHANDARI
DEPARTMENT OF COMPUTER SCIENCE
LNMIIT
 Trusted vs. Trustworthy

 A component of a system is trusted means that

 the security of the system depends on it
 failure of component can break the security policy
 determined by its role in the system
 A component is trustworthy means that
 the component deserves to be trusted
 e.g., it is implemented correctly
 determined by intrinsic properties of the component
Terminology: Trusted Computing Base

 The set of all hardware, software and procedural components that enforce the
security policy.
 in order to break security, an attacker must subvert one or more of them.

 What consists of the conceptual Trusted Computing Based in a Unix/Linux

system?
 hardware, kernel, system binaries, system configuration files, etc.
Terminology: Trusted Computing

 Technology developed by Trusted Computing Group

 AMD, HP, IBM, Intel, Microsoft
 Goal is to ensure that the computer will consistently behave in specific ways,
and those behaviors will be enforced by hardware and software.
 Use cryptography to help enforce a selected behavior
 Controversial
 Provide features that can be used to secure hardware against the owner
Two Key Features of TC

 Sealed Storage: Stored data can only be opened by certain software/hardware

combination
 Can be used for DRM

 Remote Attestation: remote certification that only authorized code is running on

a system

 Concerns: Loss of control by end users, privacy

Terminology: Trusted Platform Module

 Trusted Platform Module

 a specification by TCP or implementation of the specification
 a hardware module (integrated circuit) that provides
 secure generation of cryptographic keys,
 storage of keys that cannot be retrieved
a Hardware Random Number Generator.
 remote attestation, etc
TPM

• Current Applications
• Hard drive encryption

• Potential Apps
• DRM
• Fighting pirate software

Trusted Platform Module on Asus motherboard (from Wikipedia)

 What makes a “Trusted OS”

 Trusted OS = Additional Security Features + Higher level of assurance

 Examples: TrustedBSD, Trusted Solaris
 Extra security features (compared to ordinary OS)
 Often including support for Multi-level Security
 More secure implementation & deployment
 Apply secure design and coding principles
 Assurance and certification
 Code audit or formal verification
 Maintenance procedures
 Apply patches, etc.
Sample Features of “Trusted OS”

 Mandatory access control

 Often for confidentiality
 Object reuse protection
 Write over old data when file space is allocated
 Complete mediation
 Prevent any access that circumvents monitor
 Auditing
 Log security-related events and check logs
Assurance

 Trusted OS = Additional Security Features + Higher level of assurance

 Assurance: “estimate of the likelihood that a system will not fail in some
particular way”
 Based on factors such as
 Software architecture
 Development process
 Who developed it
 Technical assessment
Attestation

Manf. PCA
Cert. Cert
.

Privacy
EK AIK CA

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.
EK AIK

Privacy
CA

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.
EK AIK

Privacy
CA

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.
AIK

Privacy
CA

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA
AIK

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA
AIK Challenge!

New Node
?
EK EK AIK AIK Trusted Nodes
Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA
AIK

02895…

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA
AIK
Append nonce
and sign PCRs
with priv_AIK
10110…

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA

AIK

10110…

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA
AIK
AIK

10110…

New Node

EK EK AIK AIK Trusted Nodes

Attestation

Manf. PCA
Cert. Cert
.

Privacy
CA
AIK
AIK

10110…

New Node

EK EK AIK AIK Trusted Nodes

Attestation
Manf. PCA
Cert. Cert
.

Privacy
CA

AIK Verify bits match: AIK

SHA-1(expected PCRs |
nonce)
10110…

New Node SUCCESS!

EK EK AIK AIK Trusted Nodes
Steganography and Watermarking

SHWETA BHANDARI
DEPARTMENT OF COMPUTER SCIENCE
LNMIIT
Steganography?

 Steganography comes from the Greek words meaning covered writing.

 It is the art and the science of hiding communications.
 In many cases critical evidence is hidden inside images, audio or video files
using widely-available steganography tools.
 Steganography is different from encryption in that cryptography does not conceal
that a message has been encrypted but the message is unreadable without a
specific key.
 Steganography on the other hand hides the existence of hidden data.
 Without using tools humans would not detect the presence of the image.
Steganography?

 Literally, “covered writing”

 Invisible inks
 Character arrangement (non-cryptographic)
 Wax coverings
 Formal Definition:
“Steganography is the technique of concealing information within seemingly
innocuous carriers. It is the art and science of writing hidden messages in
such a way that no one, apart from the sender and intended recipient,
suspects the existence of the message.”
Steganography

 However most steganography encrypts the hidden message first and then hides it in digital
or audio files.
 The combination of steganography and cryptography provides two levels of hidden data
protection.
 Steganalysis is the process of detecting steganography and then recovering hidden
evidence.
 INFORMATION HIDING
SUBDISCIPLINES

 Covert channels, especially in operating systems and networks. They are communication paths that
were neither designed nor intended to transfer information at all, but are used that way. These channels
are typically used by untrustworthy programs to leak information to their owner while performing
service for another program.
 Anonymity is finding ways to hide meta content of the message (for example the sender and/or the
recipients of the message). Anonymity is need when making on-line voting or to hide access to some
web pages, or to hide sender.
 Steganography - covered writing
 Watermarking - visible digital watermarks and also imperceptible (invisible, transparent,....)
watermarks.
 Steganography vs. Watermarking

Differences between steganography and watermarking are both subtle and essential.

The main goal of steganography is to hide a message m in some audio or video (cover) data d, to
obtain new data d', practically indistinguishable from d, by people, in such a way that an
eavesdropper cannot detect the presence of m in d'.

The main goal of watermarking is to hide a message m in some audio or video (cover) data d, to
obtain new data d', practically indistinguishable from d, by people, in such a way that an
eavesdropper cannot remove or replace m in d'.
Steganography vs. Watermarking

The goal of steganography is to hide a message in one-to-one communications and the

goal of watermarking is to hide message in one-to-many communications.

Cryptography is about protecting the content of messages, steganography is about

concealing its very existence.

Steganography methods usually do not need to provide strong security against removing or
modification of the hidden message. Watermarking methods need to be very robust to
attempts to remove or modify a hidden message.
 Steganography/Watermarking vs. Cryptography

The purpose of both is to provide secret communication.

Cryptography hides the contents of the message from an attacker, but not the existence of the
message.

Steganography/watermarking even hide the very existence of the message in the

communicating data.
 Steganography/Watermarking vs. Cryptography

Consequently, theconcept of breaking the system is different for cryptosystems and

stegosystems (watermarking systems).

• A cryptographic system is broken when the attacker can read the secrete message.
• Breaking of a steganographic/watermarking system has two stages:
 - The attacker can detect that steganography/watermarking has been used;
 - The attacker is able to read, modify or remove the hidden message.

A steganography/watermarking system is considered as insecure already if the detection of

steganography/watermarking is possible.
 Steganography Generic Model

Steganographic algorithms are in general based on replacing noise component of a digital object with a to-be-hidden message.
Kirchoffo’s principle holds also for steganography. Security of the system should not be based on hiding embedding
algorithm, but on hiding the key.
Basic Concepts of Stego System
 Basic Concepts of Stego System

•Covertext (cover-data - cover-object) is an original unaltered message.

• Embedding process: in which the sender, Alice, tries to hide a message by embedding it into a (randomly chosen) cover-text,
usually using a key, to obtain a stego-text (stego-data or stego-object). The embedding process can be described by the mapping
E:C X K X M  C, where C is the set of possible cover- and stego-texts, K is the set of keys and M is the set of messages.

• Stegotext (stego-data - stego-object)

• Recovering process (or extraction process) in which the receiver, Bob, tries to get, using the key only, not the covertext, the
hidden message in the stegotext.
The recovery process can be seen as mapping D: C X K  C

• Security requirement is that a third person watching such a communication should not be able to find out whether the sender
has been active, and when, in the sense that he really embedded a message in the cover -text. In other words, stegotexts should
be indistinguishable from covertexts.
Basic Types of Stegosystem

There are three basic types of stegosystems:

Pure stegosystems - no key is used.

Secret-key stegosystems - secret key is used.
Public-key stegosystems - public key is used.
 Pure stegosystems

 Definition Pure stegosystem

S = (C, M, E, D )
where C is the set of possible covertexts,
M is the set of secret messages, |C| != |M|,
E:C X M  C is the embedding function and
D:C  M, is the extraction function, with the property that
D(E(c,m)) = m, for all m  M and c  C.

 Security of the pure stegosystems depends completely on its [Link] the other hand,
security of other two stegosystems depends on the secrecy of the key used.
Secret-key stegosystems

 Definition Secret-key (asymetric) stegosystem

S = ( C, M, K, EK, DK )
where C is the set of possible covertexts,
M is the set of secret messages, |C| != |M|,
K is the set of secret keys,
EK:C X M X K  C,
DK:C X K  M with the property that
DK(EK(c,m,k),k) = m for all m  M , c  C and k  K.
Public-key stegosystems

 Similarly as in case of the public-key cryptography, two keys are used: a public-key E for
embedding and a private-key D for recovering.

 It is often useful to combine such a public-key stegosystem with a public-key

cryptosystem.

 For example, in case Alice wants to send a message m to Bob, encode first m using Bob’s
public key eB, then make embedding of eB(m) using process E into a cover and sends the
resulting stegotext to Bob, who recovers eB(m) using D and then decrypts it, using
decryption function dB.
 Steganography Applications

•To have secure secret communications where cryptographic encryption methods are not available.

• To have secure secret communication where strong cryptography is impossible.

• In some cases, for example in military applications, even the knowledge that two parties
communicate can be of large importance.

• The health care, and especially medical imaging systems, may very much benefit from information
hiding techniques.
Security of Steganography

 Definition A steganographic algorithm is called secure if

• Messages are hidden using a public algorithm and a secret key. The secret key must
identify the sender uniquely.
• Only the holder of the secret key can detect, extract and prove the existence of the
hidden message. (Nobody else should be able to find any statistical evidence of a
message's existence.)
• Even if an enemy gets the contents of one hidden message, he should have no chance
of detecting others.
• It is computationally infeasible to detect hidden messages.
 History of Watermarking

Paper watermarks appeared in the art of handmade papermarking 700 hundred years ago.
Watermarks were mainly used to identify the mill producing the paper and paper format, quality and
strength.
Paper watermarks was a perfect technique to eliminate confusion from which mill paper is and what
are its parameters.
Legal power of watermarks has been demonstrated in 1887 in France when watermarks of two
letters, presented as a piece of evidence in a trial, proved that the letters had been predated, what
resulted in the downfall of a cabinet and, finally, the resignation of the president Grévy.
Paper watermarks in bank notes or stamps inspired the first use of the term water mark in the context
of digital data.
The first publications that really focused on watermarking of digital images were from 1990 and then
in 1993.
 Embedding and Extraction in Watermarking

Watermarking Embedding System

 Inputs to the scheme are

 the watermark,
 the cover data and
 an optional public or secret key.
 The output are watermarked data. The key is used to enforce security
 Embedding and Extraction in Watermarking

Watermarking Extraction

 Inputs to the scheme are

 the watermarked data,
 the secret or public key and,
 depending on the method, the original data and/or the original watermark.
 The output is the recovered watermarked W or some kind of confidence measure indicating how likely
it is for the given watermark at the input to be present in the data under inspection.
 Types of Watermarking Schemes

Private (non-blind) watermarking systems require for extraction/detection the original cover-data.
Type I systems use the original cover-data to extract the watermark from stego-data and use
original cover-data to determine where the watermark is.
Type II systems require a copy of the embedded watermark for extraction and just yield a
yes/no answer to the question weather stego-data contains a watermark..
Semi-private (semi-blind) watermarking does not use the original cover-data for detection, but
tries to answer the same question. (Potential application of blind and semi-blind watermarking is for
evidence in court ownership,....)
Public (blind) watermarking - neither cover-data nor embedded watermarks are required for
extraction - this is the most challenging problem.
 Watermarking Applications

A popular application of watermarking techniques is to provide a proof of ownership of digital data by

embedding copyright statements into video or image digital products.
Watermarking has recently emerged as the leading technology to solve the above very important problems.
Automatic monitoring and tracking of copy-write material on WEB. (For example, a robot searches the
Web for marked material and thereby identifies potential illegal issues.)
Automatic audit of radio transmissions: (A robot can “listen” to a radio station and look for marks,
which indicate that a particular piece of music, or advertisement , has been broadcast.)
Data augmentation - to add information for the benefit of the public.
Fingerprinting applications (in order to distinguish distributed data)
All kind of data can be watermarked: audio, images, video, formatted text, 3D models, model animation
parameters,
THANK YOU !