Sciweavers

2432 search results - page 10 / 487
» Cryptographic logical relations
Sort
View
INDOCRYPT
2001
Springer
15 years 2 months ago
Cryptographic Functions and Design Criteria for Block Ciphers
Most last-round attacks on iterated block ciphers provide some design criteria for the round function. Here, we focus on the links between the underlying properties. Most notably, ...
Anne Canteaut
FOSSACS
2009
Springer
15 years 4 months ago
Cryptographic Protocol Composition via the Authentication Tests
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
Joshua D. Guttman
CADE
2005
Springer
15 years 10 months ago
Regular Protocols and Attacks with Regular Knowledge
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
Tomasz Truderung
EIT
2008
IEEE
15 years 4 months ago
Relating Boolean gate truth tables to one-way functions
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
Mahadevan Gomathisankaran, Akhilesh Tyagi
LICS
2009
IEEE
15 years 4 months ago
Logical Step-Indexed Logical Relations
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
Derek Dreyer, Amal Ahmed, Lars Birkedal