292 search results - page 3 / 59 » Communication and Round Efficient Information Checking Proto... |
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
ISW
2005
Springer
14 years 26 days ago
2005
Springer
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
SACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
COOPIS
2004
IEEE
13 years 11 months ago
2004
IEEE
Abstract. Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reu...
KDD
2006
ACM
14 years 7 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...