Sciweavers

576 search results - page 82 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
PLDI
2006
ACM
14 years 2 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
JOC
2007
133views more  JOC 2007»
13 years 8 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 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
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
14 years 19 days ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
IEEEARES
2008
IEEE
14 years 3 months ago
Static Validation of Licence Conformance Policies
Policy conformance is a security property gaining importance due to commercial interest like Digital Rights Management. It is well known that static analysis can be used to valida...
René Rydhof Hansen, Flemming Nielson, Hanne...