1763 search results - page 76 / 353 » A Formalization of Polytime Functions |
CSFW
2011
IEEE
13 years 9 months ago
2011
IEEE
—We propose a much-needed formal definition of security for cryptographic key management APIs. The advantages of our definition are that it is general, intuitive, and applicabl...
114
click to vote
ICDCSW
2011
IEEE
13 years 9 months ago
2011
IEEE
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
ASIACRYPT
2008
Springer
14 years 12 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
IFL
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...