Sciweavers

CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali