5484 search results - page 1 / 1097 » Almost-Everywhere Secure Computation |
EUROCRYPT
2008
Springer
14 years 19 days ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
ENTCS
2007
13 years 10 months ago
2007
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
LOGCOM
2008
13 years 10 months ago
2008
Following recent developments in the topic of generalized quantifiers, and also having in mind applications in the areas of security and artificial intelligence, a conservative en...
MLQ
2007
13 years 10 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
CONCUR
2005
Springer
14 years 4 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...