1458 search results - page 68 / 292 » The sequentially realizable functionals |
129
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
110
Voted
IEEEARES
2007
IEEE
15 years 9 months ago
2007
IEEE
—In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal...
109
Voted
INTERACT
2003
15 years 4 months ago
2003
: In one study, people are observed to keep web information for later use through many different methods including the use of Bookmarks (or Favorites), self-addressed email, hand-w...
118
Voted
ET
2002
15 years 3 months ago
2002
In this paper we explore two alternative approaches to system diagnosis. The first strategy is based on testability analysis performed by SATAN tool. The second approach performed ...
142
Voted
CP
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...