28 search results - page 4 / 6 » An Efficient Protocol for Secure Two-Party Computation in th... |
IACR
2011
12 years 8 months ago
2011
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
CTRSA
2008
Springer
13 years 10 months ago
2008
Springer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
PKC
2010
Springer
13 years 10 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
STOC
2010
ACM
14 years 58 min ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...