Sciweavers

164 search results - page 30 / 33
» Covert two-party computation
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
TDP
2010
166views more  TDP 2010»
13 years 4 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
CRYPTO
2009
Springer
122views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Utility Dependence in Correct and Fair Rational Secret Sharing
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
Gilad Asharov, Yehuda Lindell
SIGECOM
2009
ACM
118views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
Modeling volatility in prediction markets
There is significant experimental evidence that prediction markets are efficient mechanisms for aggregating information and are more accurate in forecasting events than tradition...
Nikolay Archak, Panagiotis G. Ipeirotis