Encryption for Digital Content (Paperback, 2010 ed.)

Cryptography is an area that traditionally focused on secure communication, authentication and integrity. In recent times though, there is a wealth of novel fine-tuned cryptographic techniques that sprung up as cryptographers focused on the specialised problems that arise in digital content distribution. These include fingerprinting codes, traitor tracing, broadcast encryption and others. This book is an introduction to this new generation of cryptographic mechanisms as well as an attempt to provide a cohesive presentation of these techniques. Encryption for Digital Content details the subset cover framework (currently used in the AACS encryption of Blu-Ray disks), fingerprinting codes, traitor tracing schemes as well as related security models and attacks. It provides an extensive treatment of the complexity of the revocation problem for multi-receiver (subscriber) encryption mechanisms, as well as the complexity of the traceability problem. Pirate evolution type of attacks are covered in depth. This volume also illustrates the manner that attacks affect parameter selection, and how this impacts implementations. The authors gratefully acknowledge the support of the National Science Foundation under Grant No. 0447808.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Advances in Information Security, 52
Release date:	December 2012
First published:	2010
Authors:	Aggelos Kiayias • Serdar Pehlivanoglu
Dimensions:	235 x 155 x 12mm (L x W x T)
Format:	Paperback
Pages:	209
Edition:	2010 ed.
ISBN-13:	978-1-4614-2721-6
Categories:	Books > Computing & IT > Applications of computing > Databases > Data security & data encryption Promotions
LSN:	1-4614-2721-5
Barcode:	9781461427216

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!