Sciweavers

256 search results - page 47 / 52
» Separation of NP-Completeness Notions
Sort
View
PODC
1999
ACM
13 years 11 months ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
13 years 11 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
CSFW
2004
IEEE
13 years 11 months ago
The Consistency of Task-Based Authorization Constraints in Workflow Systems
Workflow management systems (WFMSs) have attracted a lot of interest both in academia and the business community. A workflow consists of a collection of tasks that are organized t...
Kaijun Tan, Jason Crampton, Carl A. Gunter
CCS
2006
ACM
13 years 11 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang
DCOSS
2006
Springer
13 years 11 months ago
Distance-Sensitive Information Brokerage in Sensor Networks
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu ...