227 search results - page 3 / 46 » On the Reachability Problem in Cryptographic Protocols |
LPAR
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
IFIP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
CRYPTO
2000
Springer
13 years 11 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...