2967 search results - page 164 / 594 » Cryptology |
197
click to vote
ASIACRYPT
2010
Springer
15 years 5 months ago
2010
Springer
So far, all solutions proposed for authenticated key agreement combine key agreement and authentication into a single cryptographic protocol. However, in many important applicatio...
181
click to vote
TCC
2010
Springer
15 years 5 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)...
176
click to vote
TCC
2010
Springer
15 years 5 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...
177
click to vote
TCC
2010
Springer
15 years 5 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...
208
click to vote
CISC
2009
Springer
15 years 5 months ago
2009
Springer
In a selective private function evaluation (SPFE) protocol, the client privately computes some predefined function on his own input and on m out of server's n database element...