34 search results - page 2 / 7 » tcc 2010 |
TCC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
TCC
2010
Springer
13 years 2 months ago
2010
Springer
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
TCC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
TCC
2010
Springer
13 years 3 months ago
2010
Springer
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...