Sciweavers

319 search results - page 7 / 64
» Identification Protocols Secure against Reset Attacks
Sort
View
ASIACRYPT
2008
Springer
14 years 11 months ago
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
BCS
2008
14 years 11 months ago
Distributed Defence Against Denial of Service Attacks: A Practical View
In recent years, Denial of Service attacks have evolved into a predominant network security threat. In our previous work, we identified the necessary building blocks for an effect...
Gülay Öke, Georgios Loukas
ACISP
2004
Springer
15 years 2 months ago
On Security of XTR Public Key Cryptosystems Against Side Channel Attacks
The XTR public key system was introduced at Crypto 2000. Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead...
Dong-Guk Han, Jongin Lim, Kouichi Sakurai
ADHOC
2008
132views more  ADHOC 2008»
14 years 9 months ago
Defending against cache consistency attacks in wireless ad hoc networks
Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, the issue of cache consistency must be addres...
Wensheng Zhang, Guohong Cao
WSS
2001
110views Control Systems» more  WSS 2001»
14 years 11 months ago
On the Security and Vulnerability of PING
We present a formal specification of the PING protocol, and use three concepts of convergence theory, namely closure, convergence, and protection, to show that this protocol is se...
Mohamed G. Gouda, Chin-Tser Huang, Anish Arora