Sciweavers

227 search results - page 25 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
JNW
2008
177views more  JNW 2008»
13 years 7 months ago
Design and Evaluation of a Novel HIP-Based Network Mobility Protocol
The rapid growth of IP-based mobile telecommunication technologies in the past few years has revealed situations where not only a single node but an entire network moves and change...
Szabolcs Nováczki, László Bok...
FROCOS
2007
Springer
14 years 1 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
EUROCRYPT
2008
Springer
13 years 9 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
IWCMC
2006
ACM
14 years 1 months ago
A novel broadcast technique for high-density ad hoc networks
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...
Ai Hua Ho, Alexander J. Aved, Kien A. Hua
CSFW
2009
IEEE
13 years 11 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung