Information forensics: An overview of the first decade

MC Stamm, M Wu, KJR Liu - IEEE access, 2013 - ieeexplore.ieee.org
In recent decades, we have witnessed the evolution of information technologies from the
development of VLSI technologies, to communication and networking infrastructure, to the …

[КНИГА][B] Cryptography: theory and practice

DR Stinson - 2005 - api.taylorfrancis.com
THE LEGACYFirst introduced in 1995, Cryptography: Theory and Practice garnered
enormous praise and popularity, and soon became the standard textbook for cryptography …

Optimal probabilistic fingerprint codes

G Tardos - Journal of the ACM (JACM), 2008 - dl.acm.org
We construct binary codes for fingerprinting digital documents. Our codes for n users that are
ε-secure against c pirates have length O (c 2log (n/ε)). This improves the codes proposed by …

Fully collusion resistant traitor tracing with short ciphertexts and private keys

D Boneh, A Sahai, B Waters - … international conference on the theory and …, 2006 - Springer
We construct a fully collusion resistant tracing traitors system with sublinear size ciphertexts
and constant size private keys. More precisely, let N be the total number of users. Our …

A fully collusion resistant broadcast, trace, and revoke system

D Boneh, B Waters - Proceedings of the 13th ACM conference on …, 2006 - dl.acm.org
We introduce a simple primitive called Augmented Broadcast Encryption (ABE) that is
sufficient for constructing broadcast encryption, traitor-tracing, and trace-and-revoke …

Digital fingerprinting codes: Problem statements, constructions, identification of traitors

A Barg, GR Blakley… - IEEE Transactions on …, 2003 - ieeexplore.ieee.org
We consider a general fingerprinting problem of digital data under which coalitions of users
can alter or erase some bits in their copies in order to create an illegal copy. Each user is …

Collusion resistant traitor tracing from learning with errors

R Goyal, V Koppula, B Waters - Proceedings of the 50th annual ACM …, 2018 - dl.acm.org
In this work we provide a traitor tracing construction with ciphertexts that grow polynomially
in log (n) where n is the number of users and prove it secure under the Learning with Errors …

Traitor tracing with constant size ciphertext

D Boneh, M Naor - Proceedings of the 15th ACM conference on …, 2008 - dl.acm.org
A traitor tracing system enables a publisher to trace a pirate decryption box to one of the
secret keys used to create the box. We present a traitor tracing system where ciphertext size …

Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes

B Škorić, S Katzenbeisser, MU Celik - Designs, Codes and Cryptography, 2008 - Springer
Fingerprinting provides a means of tracing unauthorized redistribution of digital data by
individually marking each authorized copy with a personalized serial number. In order to …

Traitor tracing with constant transmission rate

A Kiayias, M Yung - International Conference on the Theory and …, 2002 - Springer
An important open problem in the area of Traitor Tracing is designing a scheme with
constant expansion of the size of keys (users' keys and the encryption key) and of the size of …