964 search results - page 162 / 193 » On Securely Scheduling a Meeting |
177
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
196
click to vote
USS
2008
15 years 9 months ago
2008
We examine the security requirements for creating a Deniable File System (DFS), and the efficacy with which the TrueCrypt disk-encryption software meets those requirements. We fin...
194
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
204
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
Enterprise networks are important, with size and complexity even surpassing carrier networks. Yet, the design of enterprise networks remains ad-hoc and poorly understood. In this p...
153
click to vote
NIPS
2004
15 years 8 months ago
2004
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...