Sciweavers

469 search results - page 32 / 94
» On Adversary Models and Compositional Security
Sort
View
TC
2008
13 years 7 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
FOCS
2007
IEEE
14 years 2 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
CCS
2008
ACM
13 years 9 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 2 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
DRM
2006
Springer
13 years 11 months ago
Towards a secure and interoperable DRM architecture
In this paper we look at the problem of interoperability of digital rights management (DRM) systems in home networks. We introduce an intermediate module called the Domain Interop...
Gelareh Taban, Alvaro A. Cárdenas, Virgil D...