Sciweavers

194 search results - page 18 / 39
» Computing Roundness is Easy if the Set is Almost Round
Sort
View
NDSS
2009
IEEE
14 years 2 months ago
Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan ...
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Improving the Security of Quantum Protocols via Commit-and-Open
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
Ivan Damgård, Serge Fehr, Carolin Lunemann, ...
CONEXT
2010
ACM
13 years 5 months ago
ICTCP: Incast Congestion Control for TCP in data center networks
TCP incast congestion happens in high-bandwidth and lowlatency networks, when multiple synchronized servers send data to a same receiver in parallel [15]. For many important data ...
Haitao Wu, Zhenqian Feng, Chuanxiong Guo, Yongguan...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
IPCO
2007
140views Optimization» more  IPCO 2007»
13 years 9 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan