Sciweavers

22 search results - page 5 / 5
» Universally-Composable Two-Party Computation in Two Rounds
Sort
View
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 6 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003