11063 search results - page 324 / 2213 » On the existence of universal models |
206
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
162
click to vote
ICICS
2009
Springer
16 years 1 months ago
2009
Springer
Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works o...
142
click to vote
PROVSEC
2009
Springer
16 years 1 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
190
click to vote
ACNS
2007
Springer
16 years 29 days ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
184
click to vote
ECAL
2007
Springer
16 years 28 days ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...