391 search results - page 74 / 79 » Secure Multiparty AES |
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
ADC
2007
Springer
14 years 1 months ago
2007
Springer
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
ESORICS
2010
Springer
13 years 8 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
EDBT
2010
ACM
13 years 6 months ago
2010
ACM
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...