154 search results - page 3 / 31 » Computing universal models under guarded TGDs |
TCC
2009
Springer
14 years 6 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
AGI
2008
13 years 7 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
WSPI
2004
13 years 7 months ago
2004
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...
IACR
2011
12 years 6 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
ICAC
2007
IEEE
14 years 21 days ago
2007
IEEE
We present a generic architecture for developing fullyfledged autonomic systems out of non-autonomic components, and investigate how the architecture can be implemented using exi...