91 search results - page 12 / 19 » Bounded Key-Dependent Message Security |
CSFW
2009
IEEE
14 years 2 months ago
2009
IEEE
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
IACR
2011
12 years 7 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
ACNS
2008
Springer
14 years 1 months ago
2008
Springer
In this paper, we present an analysis of the CCM mode of operations and of a slight variant. CCM is a simple and efficient encryption scheme which combines a CBC-MAC authentication...