Sciweavers

1612 search results - page 253 / 323
» About models of security protocols
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
COMCOM
2002
189views more  COMCOM 2002»
14 years 9 months ago
Intrusion detection techniques and approaches
Recent security incidents and analysis have demonstrated that manual response to such attacks is no longer feasible. Intrusion Detection systems offer techniques for modelling and...
Theuns Verwoerd, Ray Hunt
MOBIHOC
2008
ACM
15 years 9 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
INFOCOM
2006
IEEE
15 years 3 months ago
Time Synchronization for High Latency Acoustic Networks
— Distributed time synchronization is an important part of a sensor network where sensing and actuation must be coordinated across multiple nodes. Several time synchronization pr...
Affan A. Syed, John S. Heidemann
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
14 years 11 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...