1380 search results - page 127 / 276 » A General Polynomial Sieve |
ICDCS
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
RTSS
2002
IEEE
14 years 3 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
EUROCRYPT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
LICS
1997
IEEE
14 years 2 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Many existing pairwise key establishment in sensor networks were developed based on the polynomial-based method. However, this method cannot offer the basic authentication function...