111 search results - page 8 / 23 » Characterization of Secure Multiparty Computation Without Br... |
TCC
2009
Springer
15 years 10 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...
241
click to vote
VLDB
2006
ACM
15 years 9 months ago
2006
ACM
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
SASN
2004
ACM
15 years 3 months ago
2004
ACM
This paper studies security for data aggregation in sensor networks. Current aggregation schemes were designed without security in mind and there are easy attacks against them. We...
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...