31 search results - page 2 / 7 » tcc 2005 |
TCC
2005
Springer
13 years 11 months ago
2005
Springer
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capab...
TCC
2005
Springer
13 years 11 months ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
TCC
2005
Springer
13 years 11 months ago
2005
Springer
A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CC...
TCC
2005
Springer
13 years 11 months ago
2005
Springer
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
TCC
2005
Springer
13 years 11 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...