Sciweavers

1770 search results - page 283 / 354
» Writing requirements in computer security
Sort
View
SPAA
2009
ACM
14 years 10 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
ACSAC
2002
IEEE
14 years 3 months ago
A Practical Approach to Identifying Storage and Timing Channels: Twenty Years Later
Secure computer systems use both mandatory and discretionary access controls to restrict the flow of information through legitimate communication channels such as files, shared ...
Richard A. Kemmerer
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
SOSP
2003
ACM
14 years 7 months ago
Decentralized user authentication in a global file system
The challenge for user authentication in a global file system is allowing people to grant access to specific users and groups in remote administrative domains, without assuming ...
Michael Kaminsky, George Savvides, David Mazi&egra...
INFOCOM
2009
IEEE
14 years 4 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li