434 search results - page 35 / 87 » Logical Analysis of Hash Functions |
100
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
120
click to vote
TC
2008
15 years 12 days ago
2008
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
109
click to vote
DATESO
2007
15 years 1 months ago
2007
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
PLDI
2005
ACM
15 years 6 months ago
2005
ACM
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...