Sciweavers

370 search results - page 6 / 74
» Limits of Constructive Security Proofs
Sort
View
RFIDSEC
2010
15 years 2 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
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...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
CTRSA
2006
Springer
176views Cryptology» more  CTRSA 2006»
15 years 7 months ago
Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
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...
Dan Boneh, Xavier Boyen, Shai Halevi
CSFW
1997
IEEE
15 years 8 months ago
Eliminating Covert Flows with Minimum Typings
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...
Dennis M. Volpano, Geoffrey Smith
ESORICS
2009
Springer
16 years 4 months ago
PCAL: Language Support for Proof-Carrying Authorization Systems
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...
Avik Chaudhuri, Deepak Garg
ACSAC
2003
IEEE
15 years 9 months ago
Log Correlation for Intrusion Detection: A Proof of Concept
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...
Cristina Abad, Jed Taylor, Cigdem Sengul, William ...