Sciweavers

570 search results - page 35 / 114
» Black-box constructions for secure computation
Sort
View
SASN
2003
ACM
14 years 1 months ago
Admission control in Peer-to-Peer: design and performance evaluation
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi
ICICS
2009
Springer
14 years 2 months ago
GUC-Secure Join Operator in Distributed Relational Database
Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works o...
Yuan Tian, Hao Zhang
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
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 17 hour ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
JOC
2007
94views more  JOC 2007»
13 years 8 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...