370 search results - page 6 / 74 » Limits of Constructive Security Proofs |
RFIDSEC
2010
14 years 10 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
106
Voted
CTRSA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
103
Voted
CSFW
1997
IEEE
15 years 3 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
108
click to vote
ESORICS
2009
Springer
16 years 8 days ago
2009
Springer
By shifting the burden of proofs to the user, a proof-carrying authorization (PCA) system can automatically enforce complex access control policies. Unfortunately, managing those p...
ACSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
Intrusion detection is an important part of networkedsystems security protection. Although commercial products exist, finding intrusions has proven to be a difficult task with l...