700 search results - page 26 / 140 » et 2008 |
LOGCOM
2008
13 years 7 months ago
2008
In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109
CANS
2008
Springer
13 years 9 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
CP
2009
Springer
14 years 8 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
IJNSEC
2008
13 years 7 months ago
2008
Recently, M. Abdalla et al. proposed a slightly different variant of AuthA, based on the scheme proposed by E. Bresson et al., and provided the first complete proof of forward-sec...
COLING
2010
13 years 2 months ago
2010
Martins et al. (2008) presented what to the best of our knowledge still ranks as the best overall result on the CONLLX Shared Task datasets. The paper shows how triads of stacked ...