860 search results - page 19 / 172 » Completeness in two-party secure computation: a computationa... |
139
click to vote
PERVASIVE
2006
Springer
15 years 6 months ago
2006
Springer
The rich interaction capabilities of public terminals can make them more convenient to use than small personal devices, such as smart phones. However, the use of public terminals t...
185
click to vote
CRYPTO
2010
Springer
15 years 2 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
162
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
158
click to vote
CCS
2006
ACM
15 years 9 months ago
2006
ACM
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
149
click to vote
PKC
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...