Sciweavers

43 search results - page 5 / 9
» Automated Security Proof for Symmetric Encryption Modes
Sort
View
FSE
2003
Springer
123views Cryptology» more  FSE 2003»
14 years 21 days ago
The Security of "One-Block-to-Many" Modes of Operation
In this paper, we investigate the security, in the Luby-Rackoff security paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block ou...
Henri Gilbert
21
Voted
FUIN
2006
69views more  FUIN 2006»
13 years 7 months ago
An Efficient and Secure Cryptosystem for Encrypting Long Messages
Traditionally, due to efficiency considerations, when encrypting long messages using an asymmtric cryptosystem, one needs to use a symmetric cryptosystem in addition. To eliminate ...
Sheng Zhong
CCS
2008
ACM
13 years 9 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
EUROCRYPT
2001
Springer
13 years 12 months ago
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
Ran Canetti, Hugo Krawczyk
CADE
2010
Springer
13 years 8 months ago
Automating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...