We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Authorization policy infrastructures are evolving with the complex environments that they support. However, the requirements and technologies supporting context are not yet well u...
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Trust negotiation between two subjects require each one proving its properties to the other. Each subject specifies disclosure policies stating the types of credentials and attrib...
Indrakshi Ray, Elisa Bertino, Anna Cinzia Squiccia...
The World Wide Web provides a huge distributed web database. However, information in the web database is free formatted and unorganized. Traditional keyword-based retrieval approa...
H. L. Wang, W. K. Shih, C. N. Hsu, Y. S. Chen, Y. ...