3 citations · 3 across the 3 of their papers we have counts for
3 papers
Intersecting random graphs and networks with multiple adjacency constraints: A simple example
N. Prasanth Anthapadmanabhan, Armand M. Makowski
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional rand…
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing
N. Prasanth Anthapadmanabhan, Alexander Barg
We propose randomized frameproof codes for content protection, which arise by studying a variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a user…
On the Fingerprinting Capacity Under the Marking Assumption
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer
We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attac…