77 search results - page 5 / 16 » Keeping Bits Safe: How Hard Can It Be |
COOPIS
1998
IEEE
13 years 12 months ago
1998
IEEE
With the emergence of fast and standardized communication infrastructures over which separately designed agents of different organizations can interact in real-time, there is an i...
HOST
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper shows how lasers can be used to implement modification attacks on EEPROM and Flash memory devices. This was achieved with inexpensive laser-diode module mounted on a mic...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
IMA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
MOZ
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...