32 search results - page 2 / 7 » tcc 2007 |
TCC
2007
Springer
13 years 11 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
The informal goal of a watermarking scheme is to “mark” a digital object, such as a picture or video, in such a way that it is difficult for an adversary to remove the mark wit...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. An obfuscation O of a function F should satisfy two requirements: firstly, using O it should be possible to evaluate F; secondly, O should not reveal anything about F th...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...