2043 search results - page 268 / 409 » Reasoning About Security Models |
97
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
86
Voted
IEEEARES
2009
IEEE
15 years 7 months ago
2009
IEEE
—In voting, the notion of receipt-freeness has been proposed to express that a voter cannot gain any information to prove that she has voted in a certain way. It aims to prevent ...
102
click to vote
SACRYPT
2004
Springer
15 years 6 months ago
2004
Springer
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
102
Voted
ACSAC
2010
IEEE
14 years 11 months ago
2010
IEEE
IP blacklists are a spam filtering tool employed by a large number of email providers. Centrally maintained and well regarded, blacklists can filter 80+% of spam without having to...
133
click to vote
TACAS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...