We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new e...
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
In this paper, we consider the norm-trace curves which are defined by the equation yqr−1 + yqr−2 + · · · + y = x qr−1 q−1 over IFqr where q is a power of a prime number...