154 search results - page 2 / 31 » Computing universal models under guarded TGDs |
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
RTAS
2005
IEEE
13 years 11 months ago
2005
IEEE
No one middleware communication model completely solves the problem of ensuring schedulability in every DRE system. Furthermore, there have been few studies to date of the trade-o...
CVPR
2009
IEEE
15 years 17 days ago
2009
IEEE
In this paper, we present an enhanced Pictorial Struc-
ture (PS) model for precise eye localization, a fundamen-
tal problem involved in many face processing tasks. PS is
a comp...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...