3228 search results - page 151 / 646 » Computationally Sound Proofs |
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In a hybrid peer-to-peer environment, clients can either directly download data from their server, or share data with each other. In order to create incentives for client...
106
click to vote
AAAI
2010
15 years 4 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
111
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
115
click to vote
CJ
2007
15 years 2 months ago
2007
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer s...
146
click to vote
CSFW
2012
IEEE
13 years 5 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...