Sciweavers

321 search results - page 24 / 65
» Secure Multiparty Computation of Approximations
Sort
View
WISEC
2010
ACM
14 years 4 months ago
Privacy-preserving computation of benchmarks on item-level data using RFID
Currently, companies are about to optimize their internal processes by monitoring items they handle with Radio Frequency Identification (RFID). However, there is a risk that sens...
Florian Kerschbaum, Nina Oertel, Leonardo Weiss Fe...
SASN
2004
ACM
14 years 4 months ago
Resilient aggregation in sensor networks
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...
David Wagner
CCS
2009
ACM
14 years 5 months ago
Multi-party off-the-record messaging
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...
Ian Goldberg, Berkant Ustaoglu, Matthew Van Gundy,...
ASIACRYPT
2005
Springer
14 years 4 months ago
Privacy-Preserving Graph Algorithms in the Semi-honest Model
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
Justin Brickell, Vitaly Shmatikov
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 3 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain