2432 search results - page 237 / 487 » Cryptographic logical relations |
173
Voted
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
We address the issue of encrypting data in local storage using a key that is derived from the user's password. The typical solution in use today is to derive the key from the...
194
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
172
Voted
DAM
2008
15 years 6 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
212
click to vote
CTRSA
2011
Springer
14 years 10 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
139
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...