Sciweavers

123 search results - page 4 / 25
» Modelling the relative strength of security protocols
Sort
View
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
ESAS
2006
Springer
13 years 9 months ago
Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol
We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models...
Baruch Awerbuch, Robert G. Cole, Reza Curtmola, Da...
IPCCC
2005
IEEE
13 years 11 months ago
Source routing based pairwise key establishment protocol for sensor networks
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. The establishment...
D. Huang, M. Mehta, D. Medhi
ISCC
2003
IEEE
112views Communications» more  ISCC 2003»
13 years 10 months ago
Performance Evaluation of Public-Key Cryptosystem Operations in WTLS Protocol
WTLS (Wireless Transport Layer Security) is an important standard protocol for secure wireless access to Internet services. WTLS employs public-key cryptosystems during the handsh...
Albert Levi, Erkay Savas
CSFW
1998
IEEE
13 years 9 months ago
Proving Security Protocols with Model Checkers by Data Independence Techniques
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
A. W. Roscoe