150 search results - page 14 / 30 » Oblivious Transfer Is Symmetric |
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
SCN
2010
Springer
13 years 5 months ago
2010
Springer
At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model. However, Green and Hohen...
ICICS
2005
Springer
14 years 1 months ago
2005
Springer
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
CRYPTO
1990
Springer
13 years 11 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...