14386 search results - page 2580 / 2878 » The Chinese Generals Problem |
171
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
177
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
184
Voted
PKC
2009
Springer
16 years 7 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
194
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
173
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...