Sciweavers

12015 search results - page 2206 / 2403
» Interactive Algorithms 2005
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 11 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 11 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 11 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
SIGMOD
2007
ACM
198views Database» more  SIGMOD 2007»
14 years 11 months ago
Addressing diverse user preferences in SQL-query-result navigation
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
Zhiyuan Chen, Tao Li
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 11 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
« Prev « First page 2206 / 2403 Last » Next »