Sciweavers

6202 search results - page 903 / 1241
» Without Loss of Generality
Sort
View
178
Voted
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
16 years 7 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
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...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 7 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Proofs of Retrievability via Hardness Amplification
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...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 7 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
KDD
2009
ACM
174views Data Mining» more  KDD 2009»
16 years 7 months ago
Audience selection for on-line brand advertising: privacy-friendly social network targeting
This paper describes and evaluates privacy-friendly methods for extracting quasi-social networks from browser behavior on user-generated content sites, for the purpose of finding ...
Foster J. Provost, Brian Dalessandro, Rod Hook, Xi...