Sciweavers

1058 search results - page 130 / 212
» Secure Group Communications Using Key Graphs
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 6 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
MMS
1998
15 years 2 months ago
The Multimedia Multicasting Problem
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications. The interaction between multicasting and the deliver...
Joseph Pasquale, George C. Polyzos, George Xylomen...
SCN
2008
Springer
147views Communications» more  SCN 2008»
15 years 2 months ago
Privacy-preserving secure relative localization in vehicular networks
Relative location information helps build vehicle topology maps. Such maps provide location information of nearby vehicles to drivers. In building a vehicle topology, one must cons...
Lei Tang, Xiaoyan Hong, Phillip G. Bradford
142
Voted
DBSEC
2010
196views Database» more  DBSEC 2010»
14 years 11 months ago
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
Abstract. This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity ...
Amril Syalim, Takashi Nishide, Kouichi Sakurai
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
15 years 7 months ago
On the security of linear consensus networks
Abstract—This work considers the problem of reaching consensus in an unreliable linear consensus network. A solution to this problem is relevant for several tasks in multi-agent ...
Fabio Pasqualetti, Antonio Bicchi, Francesco Bullo