250 search results - page 1 / 50 » A Round and Communication Efficient Secure Ranking Protocol |
90
Voted
CTRSA
2006
Springer
15 years 4 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
108
click to vote
ASIACRYPT
2000
Springer
15 years 4 months ago
2000
Springer
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
101
click to vote
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
126
click to vote
SP
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
100
click to vote
ASIACRYPT
2007
Springer
15 years 4 months ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...