860 search results - page 10 / 172 » Completeness in two-party secure computation: a computationa... |
EUROCRYPT
2011
Springer
14 years 1 months ago
2011
Springer
CSFW
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
CIS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
107
click to vote
AC
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...