51986 search results - page 144 / 10398 » Are There New Models of Computation |
137
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
159
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
140
Voted
APN
2009
Springer
15 years 10 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...
178
click to vote
PAKDD
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
186
click to vote
ASIACRYPT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. In this paper, we consider the problem of mutually authenticated key exchanges between a low-power client and a powerful server. We show how the Jakobsson-Pointcheval sch...