Sciweavers

1770 search results - page 297 / 354
» Writing requirements in computer security
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
SAC
2000
ACM
14 years 3 days ago
The Mobile Agent Technology to Support and to Access Museum Information
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
Paolo Bellavista, Antonio Corradi, Andrea Tomasi
ANCS
2009
ACM
13 years 5 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
IMA
2007
Springer
132views Cryptology» more  IMA 2007»
14 years 1 months ago
New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures
Abstract. Software based side-channel attacks allow an unprivileged spy process to extract secret information from a victim (cryptosystem) process by exploiting some indirect leaka...
Onur Aciiçmez, Shay Gueron, Jean-Pierre Sei...
MMMACNS
2005
Springer
14 years 1 months ago
A Modal Logic for Role-Based Access Control
Making correct access-control decisions is central to security, which in turn requires accounting correctly for the identity, credentials, roles, authority, and privileges of users...
Thumrongsak Kosiyatrakul, Susan Older, Shiu-Kai Ch...