4 search results - page 1 / 1 » Upper and Lower Bounds on Black-Box Steganography |
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...