Sciweavers

360 search results - page 25 / 72
» On Protection by Layout Randomization
Sort
View
CHES
2004
Springer
99views Cryptology» more  CHES 2004»
15 years 2 months ago
Defeating Countermeasures Based on Randomized BSD Representations
Abstract. The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in critical operations such as modular exponentiati...
Pierre-Alain Fouque, Frédéric Muller...
DCC
2008
IEEE
15 years 9 months ago
Semantic security for the McEliece cryptosystem without random oracles
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...
CN
2007
137views more  CN 2007»
14 years 9 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
INFOCOM
2011
IEEE
14 years 26 days ago
A robust optimization approach to backup network design with random failures
—This paper presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffi...
Matthew Johnston, Hyang-Won Lee, Eytan Modiano
ICICS
2009
Springer
15 years 4 months ago
Design of Reliable and Secure Multipliers by Multilinear Arithmetic Codes
Abstract. We propose an efficient technique for the detection of errors in cryptographic circuits introduced by strong adversaries. Previously a number of linear and nonlinear err...
Zhen Wang, Mark G. Karpovsky, Berk Sunar, Ajay Jos...