Sciweavers

26 search results - page 4 / 6
» Fighting Two Pirates
Sort
View
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
15 years 9 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
88
Voted
IH
2009
Springer
15 years 4 months ago
Estimating the Minimal Length of Tardos Code
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
Teddy Furon, Luis Pérez-Freire, Arnaud Guya...
87
Voted
PCM
2009
Springer
114views Multimedia» more  PCM 2009»
15 years 2 months ago
Improving a Digital Rights Management Scheme for Video Broadcast
The security of content distribution is a critical issue that all the content providers have to treat seriously in order to guarantee their business. Emmanuel and Kankanhalli propo...
Yongdong Wu, Feng Bao
MEDIAFORENSICS
2010
14 years 11 months ago
Better security levels for broken arrows
This paper considers the security aspect of the robust zero-bit watermarking technique `Broken Arrows'(BA),1 which was invented and tested for the international challenge BOW...
Fuchun Xie, Teddy Furon, Caroline Fontaine
CHI
2005
ACM
15 years 10 months ago
Martial arts in artificial reality
This paper presents Kick Ass Kung-Fu, a martial arts game installation where the player fights virtual enemies with kicks and punches as well as acrobatic moves such as cartwheels...
Ari Nykänen, Johanna Höysniemi, Mikko Li...