Sciweavers

588 search results - page 20 / 118
» Reducibility and Completeness in Private Computations
Sort
View
NSPW
2004
ACM
14 years 28 days ago
Property-based attestation for computing platforms: caring about properties, not mechanisms
Over the past years, the computing industry has started various initiatives announced to increase computer security by means of new hardware architectures. The most notable effort...
Ahmad-Reza Sadeghi, Christian Stüble
CISC
2005
Springer
169views Cryptology» more  CISC 2005»
14 years 1 months ago
On Bluetooth Repairing: Key Agreement Based on Symmetric-Key Cryptography
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using sym...
Serge Vaudenay
EUROCRYPT
2010
Springer
14 years 9 days ago
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryposystem relies on the use of error-correcting codes. Since...
Jean-Charles Faugère, Ayoub Otmani, Ludovic...
APAL
2007
88views more  APAL 2007»
13 years 7 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
ESCIENCE
2006
IEEE
14 years 1 months ago
Using Checkpointing to Enhance Turnaround Time on Institutional Desktop Grids
In this paper, we present a checkpoint-based scheme to improve the turnaround time of bag-of-tasks applications executed on institutional desktop grids. We propose to share checkp...
Patrício Domingues, Artur Andrzejak, Lu&iac...