Sciweavers

515 search results - page 25 / 103
» Secure Parameters for SWIFFT
Sort
View
MEDIAFORENSICS
2010
13 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
IH
2004
Springer
14 years 3 months ago
On the Possibility of Non-invertible Watermarking Schemes
Recently, there are active discussions on the possibility of non-invertible watermarking scheme. A non-invertible scheme prevents an attacker from deriving a valid watermark from a...
Qiming Li, Ee-Chien Chang
CCS
2010
ACM
13 years 10 months ago
Practical leakage-resilient identity-based encryption from simple assumptions
We provide new constructions of Leakage-Resilient IdentityBased Encryption systems (IBE) in the Standard model. We apply a hash proof technique in the existing IBE schemes of Bone...
Sherman S. M. Chow, Yevgeniy Dodis, Yannis Rousela...
IH
1998
Springer
14 years 2 months ago
Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
Dogan Kesdogan, Jan Egner, Roland Büschkes
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 10 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...