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...
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...
Yuanfang Zhang, Bryan Thrall, Stephen Torri, Chris...
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...
Xiaoyang Tan (Nanjing University of Aeronautics an...
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...
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...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...