Sciweavers

141 search results - page 6 / 29
» Oblivious Transfer and Linear Functions
Sort
View
EUROCRYPT
2007
Springer
15 years 1 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
80
Voted
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
14 years 11 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
84
Voted
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
15 years 4 months ago
Oblivious equilibrium for large-scale stochastic games with unbounded costs
— We study stochastic dynamic games with a large number of players, where players are coupled via their cost functions. A standard solution concept for stochastic games is Markov...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
PET
2010
Springer
15 years 1 months ago
Collaborative, Privacy-Preserving Data Aggregation at Scale
Combining and analyzing data collected at multiple locations is critical for a wide variety of applications, such as detecting and diagnosing malicious attacks or computing an acc...
Benny Applebaum, Haakon Ringberg, Michael J. Freed...
NIPS
1998
14 years 11 months ago
Multi-Electrode Spike Sorting by Clustering Transfer Functions
A new paradigm is proposed for sorting spikes in multi-electrode data using ratios of transfer functions between cells and electrodes. It is assumed that for every cell and electr...
Dmitry Rinberg, Hanan Davidowitz, Naftali Tishby