165 search results - page 16 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
101
click to vote
CCS
2006
ACM
15 years 3 months ago
2006
ACM
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
EUROCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information – who sends a message to w...