250 search results - page 8 / 50 » A Round and Communication Efficient Secure Ranking Protocol |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
ACNS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
CRYPTO
2003
Springer
14 years 1 months ago
2003
Springer
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...
JUCS
2008
13 years 7 months ago
2008
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...