Sciweavers

13603 search results - page 2626 / 2721
» On the Complexity of Computing Treelength
Sort
View
ASIACRYPT
2007
Springer
16 years 17 days ago
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
Matthew Green, Susan Hohenberger
ATAL
2007
Springer
16 years 17 days ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
CCS
2007
ACM
16 years 16 days ago
An analysis of browser domain-isolation bugs and a light-weight transparent defense mechanism
Browsers’ isolation mechanisms are critical to users’ safety and privacy on the web. Achieving proper isolations, however, is very difficult. Historical data show that even fo...
Shuo Chen, David Ross, Yi-Min Wang
CCS
2007
ACM
16 years 16 days ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
CIA
2007
Springer
16 years 16 days ago
Learning Initial Trust Among Interacting Agents
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
Achim Rettinger, Matthias Nickles, Volker Tresp
« Prev « First page 2626 / 2721 Last » Next »