Sciweavers

1653 search results - page 230 / 331
» Timed analysis of security protocols
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 16 days 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...
EUROCRYPT
1995
Springer
14 years 16 days ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
IJNSEC
2008
131views more  IJNSEC 2008»
13 years 9 months ago
Performance Analysis of Soft Computing Based Anomaly Detectors
Anomaly detectors have become a necessary component of the computer and information security framework. Some of the numerous drawbacks experienced by the current Anomaly detectors...
N. Srinivasan, V. Vaidehi
ACSAC
2010
IEEE
13 years 18 days ago
A quantitative analysis of the insecurity of embedded network devices: results of a wide-area scan
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...
Ang Cui, Salvatore J. Stolfo
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge