17760 search results - page 3204 / 3552 » A Generalization of the Massey-Ding Algorithm |
196
click to vote
ASIACRYPT
2007
Springer
16 years 29 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
151
click to vote
ASIACRYPT
2007
Springer
16 years 29 days ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
168
Voted
ATAL
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we develop a novel probabilistic model of computational trust that explicitly deals with correlated multi-dimensional contracts. Our starting point is to consider an...
177
click to vote
ATAL
2007
Springer
16 years 29 days ago
2007
Springer
In online, dynamic environments, the services requested by consumers may not be readily served by the providers. This requires the service consumers and providers to negotiate the...
175
click to vote
ATAL
2007
Springer
16 years 29 days ago
2007
Springer
Most Interactive Storytelling systems developed to date have followed a task-based approach to story representation, using planning techniques to drive the story by generating a s...