Sciweavers

359 search results - page 7 / 72
» On Complete Primitives for Fairness
Sort
View
LATA
2009
Springer
14 years 2 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana
AIPS
1998
13 years 8 months ago
A Complete Bidirectional Planner
The PRODIGY system is based on bidirectional planning, which is a combination of goal-directed backward chaining with simulation of plan execution. Experiments have demonstrated t...
Eugene Fink, Jim Blythe
DRM
2003
Springer
14 years 17 days ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
14 years 1 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
MOBIHOC
2004
ACM
14 years 7 months ago
Towards mobility as a network control primitive
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
David Kiyoshi Goldenberg, Jie Lin, A. Stephen Mors...