2137 search results - page 317 / 428 » Proving Abstract Non-interference |
112
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
103
click to vote
MKM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Defining functions is a major topic when building mathematical repositories. Though relatively easy in mathematical vernacular, function definitions rise a number of qu...
MMMACNS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
114
click to vote
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
130
Voted
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 8 months ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....