2846 search results - page 55 / 570 » Not one click for security |
160
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
123
click to vote
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy. We begin with a definition which enables one to clearly determine whether a given ...
130
click to vote
WISA
2007
Springer
15 years 10 months ago
2007
Springer
Multilevel security policies aim at only confidentiality assurance, with less consideration on integrity assurance and weakness in expressing channel control policies. Besides, the...
146
click to vote
SACMAT
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we propose an access control model for the Resource Description Framework (RDF). We argue that existing access control models, like the ones developed for securing e...
153
click to vote
BCS
2008
15 years 5 months ago
2008
Dependable systems evolution has been identified by the UK Computing Research Committee (UKCRC) as one of the current grand challenges for computer science. We present work toward...