2432 search results - page 215 / 487 » Cryptographic logical relations |
180
click to vote
ICISC
2008
15 years 7 months ago
2008
We propose a number of techniques for securing finite state machines (FSMs) against fault injection attacks. The proposed security mechanisms are based on physically unclonable fun...
238
click to vote
FC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The dawning Ubiquitous Computing age demands a new attacker model for the myriads of pervasive computing devices used: since a potentially malicious user is in full contr...
156
click to vote
PERVASIVE
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
168
click to vote
FPL
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
178
click to vote
IFIP
2009
Springer
15 years 3 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...