Sciweavers

2601 search results - page 350 / 521
» Secure Rewarding Schemes
Sort
View
CCS
2009
ACM
16 years 5 months ago
Efficient IRM enforcement of history-based access control policies
Inlined Reference Monitor (IRM) is an established enforcement mechanism for history-based access control policies. IRM enforcement injects monitoring code into the binary of an un...
Fei Yan, Philip W. L. Fong
EUROCRYPT
2005
Springer
15 years 10 months ago
Smooth Projective Hashing and Two-Message Oblivious Transfer
We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup’s notion of smooth projective hashing (2002). ...
Yael Tauman Kalai
CCS
2006
ACM
15 years 8 months ago
Safety and consistency in policy-based authorization systems
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
Adam J. Lee, Marianne Winslett
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
15 years 4 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
202
Voted
SIGMOD
2009
ACM
185views Database» more  SIGMOD 2009»
16 years 4 months ago
Attacks on privacy and deFinetti's theorem
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
Daniel Kifer