2891 search results - page 297 / 579 » More or Less Elaborate |
170
click to vote
PAIRING
2009
Springer
16 years 1 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
158
click to vote
RE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract—Security requirements often have implicit assumptions about trust relationships among actors. The more actors trust each other, the less stringent the security requireme...
175
click to vote
SACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash fun...
201
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
183
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...