Sciweavers

1235 search results - page 237 / 247
» Formalizing information security knowledge
Sort
View
WWW
2003
ACM
16 years 6 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 6 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
174
Voted
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
16 years 13 days ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
IFIP
2009
Springer
16 years 12 days ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
155
Voted
OOPSLA
2007
Springer
15 years 12 months ago
OOMatch: pattern matching as dispatch in Java
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch which includes and subsumes multimethods (see for example [3]), but which ...
Adam Richard, Ondrej Lhoták