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 …

We introduce the k-LWE LWE problem, a Learning With Errors variant of the k-SIS problem.
The Boneh-Freeman reduction from SIS to k-SIS suffers from an exponential loss in k. We …

In the distribution of digital content, users may collude and utilize their secret keys to create
pirate decoders which enable illegally users to receive the same service. As a useful …

A software watermarking scheme enables users to embed a message or mark within a
program while preserving its functionality. Moreover, it is difficult for an adversary to remove …

In a traitor tracing (TT) system for n users, every user has his/her own secret key. Content
providers can encrypt messages using a public key, and each user can decrypt the …

In this paper, we describe a new traitor tracing scheme which relies on Tardos' collusion
secure codes to achieve constant size ciphertexts. Our scheme is also equipped with a black …

We construct a broadcast and trace scheme (also known as trace and revoke or broadcast,
trace and revoke) with N users, where the ciphertext size can be made as low as O (N^ ε), for …

Software watermarking schemes allow a user to embed an identifier into a piece of code
such that the resulting program is nearly functionally-equivalent to the original program, and …

Identity-based traitor tracing (IBTT) scheme can be utilized to identify a private (decryption)
key of any identity that is illegally used in an identity-based broadcast encryption scheme. In …

We introduce a novel attack concept against trace and revoke schemes called pirate
evolution. In this setting, the attacker, called an evolving pirate, is handed a number of traitor …