Sciweavers

945 search results - page 32 / 189
» On the robustness of primitive words
Sort
View
144
Voted
FDTC
2009
Springer
104views Cryptology» more  FDTC 2009»
16 years 20 days ago
Low Voltage Fault Attacks on the RSA Cryptosystem
—Fault injection attacks are a powerful tool to exploit implementative weaknesses of robust cryptographic algorithms. The faults induced during the computation of the cryptograph...
Alessandro Barenghi, Guido Bertoni, Emanuele Parri...
IEEEARES
2007
IEEE
16 years 12 days ago
Secure, Resilient Computing Clusters: Self-Cleansing Intrusion Tolerance with Hardware Enforced Security (SCIT/HES)
The formidable difficulty in securing systems stems in large part from the increasing complexity of the systems we build but also the degree to which we now depend on information ...
David Arsenault, Arun Sood, Yih Huang
ICIAR
2005
Springer
15 years 11 months ago
Marrying Level Lines for Stereo or Motion
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
Nikom Suvonvorn, Samia Bouchafa, Bertrand Zavidovi...
IPTPS
2004
Springer
15 years 11 months ago
A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems
— Mutual exclusion is one of the well-studied fundamental primitives in distributed systems. However, the emerging P2P systems bring forward several challenges that can’t be co...
Shiding Lin, Qiao Lian, Ming Chen, Zheng Zhang
UPP
2004
Springer
15 years 11 months ago
Programming an Amorphous Computational Medium
Amorphous computing considers the problem of controlling millions of spatially distributed unreliable devices which communicate only with nearby neighbors. To program such a system...
Jacob Beal