Sciweavers

28 search results - page 6 / 6
» F5-A Steganographic Algorithm
Sort
View
MMSEC
2006
ACM
148views Multimedia» more  MMSEC 2006»
14 years 1 months ago
Minimizing the embedding impact in steganography
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
Jessica J. Fridrich
EUROCRYPT
2003
Springer
14 years 20 days ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 9 days ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain