Sciweavers

14704 search results - page 384 / 2941
» computing 2007
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz