Sciweavers

111 search results - page 9 / 23
» Characterization of Secure Multiparty Computation Without Br...
Sort
View
ASIACRYPT
2005
Springer
15 years 3 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
WCNC
2010
IEEE
14 years 8 months ago
Characterization of the Secrecy Region of a Single Relay Cooperative System
Abstract—Security is an important aspect for the future wireless networks. Since the number of network nodes increases constantly, and, in addition, the networks are decentralize...
Ninoslav Marina, Are Hjørungnes
WISEC
2010
ACM
15 years 2 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...
CCS
2009
ACM
15 years 4 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
2009
Springer
15 years 4 months ago
Simple Adaptive Oblivious Transfer without Random Oracle
Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol whic...
Kaoru Kurosawa, Ryo Nojima