Sciweavers

434 search results - page 75 / 87
» The Case for Browser Provenance
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 9 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...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 9 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
ICALP
2009
Springer
14 years 9 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
14 years 9 months ago
Reconciling while tolerating disagreement in collaborative data sharing
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
Nicholas E. Taylor, Zachary G. Ives
ALT
2005
Springer
14 years 5 months ago
Gold-Style and Query Learning Under Various Constraints on the Target Class
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...
Sanjay Jain, Steffen Lange, Sandra Zilles