16430 search results - page 3083 / 3286 » On Computable Tree Functions |
CASSIS
2005
Springer
14 years 1 months ago
2005
Springer
Today many interactions are carried out online through Web sites and e-services and often private and/or sensitive information is required by service providers. A growing concern r...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conve...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
EDO
2005
Springer
14 years 1 months ago
2005
Springer
This paper addresses the issues of test coverage analysis of J2EE servers. These middleware are nowadays at the core of the modern information technology’s landscape. They provi...
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...