2432 search results - page 279 / 487 » Cryptographic logical relations |
194
click to vote
CIE
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
155
click to vote
FDTC
2009
Springer
16 years 1 months ago
2009
Springer
—In order to protect crypto-systems against side channel attacks various countermeasures have been implemented such as dual-rail logic or masking. Faults attacks are a powerful t...
173
click to vote
HOST
2008
IEEE
16 years 1 months ago
2008
IEEE
—Straightforward implementations of cryptographic algorithms are known to be vulnerable to attacks aimed not at the mathematical structure of the cipher but rather at the weak po...
195
click to vote
TARK
2007
Springer
16 years 22 days ago
2007
Springer
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
211
click to vote
SIGCOMM
2004
ACM
16 years 1 days ago
2004
ACM
Name services are critical for mapping logical resource names to physical resources in large-scale distributed systems. The Domain Name System (DNS) used on the Internet, however,...