Sciweavers

42230 search results - page 7908 / 8446
» Algorithms and Complexity Results for
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 7 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
235
Voted
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 7 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
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
16 years 7 months ago
Do we mean the same?: disambiguation of extracted keyword queries for database search
Users often try to accumulate information on a topic of interest from multiple information sources. In this case a user's informational need might be expressed in terms of an...
Elena Demidova, Irina Oelze, Peter Fankhauser
312
Voted
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 7 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
« Prev « First page 7908 / 8446 Last » Next »