Let g(n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, . . . , n} so that given a union of at most r members of F, one can identify at least one of the...
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
The paper presents a semi-automated technique for feature location in source code. The technique is based on combining information from two different sources: an execution trace, ...
Although some guidelines (e.g., based on architectural principles) have been proposed for designing Virtual Environments (VEs), several usability problems can be identified only b...
Abstract. We describe a fully k-resilient traitor tracing scheme that utilizes RSA as a secret-key rather than public-key cryptosystem. Traitor tracing schemes deter piracy in broa...
John Patrick McGregor, Yiqun Lisa Yin, Ruby B. Lee