Sciweavers

23 search results - page 3 / 5
» Practical Private Set Intersection Protocols with Linear Com...
Sort
View
CCS
2011
ACM
12 years 7 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
14 years 1 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
CCS
2010
ACM
13 years 8 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
INFOCOM
2007
IEEE
14 years 2 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...