Sciweavers

CSFW
2005
IEEE

Computational and Information-Theoretic Soundness and Completeness of Formal Encryption

13 years 9 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information of the encrypted plaintext is revealed. We consider not only computational, but also purely probabilistic, information-theoretic interpretations. We present a general, systematic treatment of the expansions of the logic for symmetric encryption. We establish general soundness and completeness theorems for the interpretations. We also present applications to specific settings not covered in earlier works: a purely probabilistic one based on One-Time Pad, and computational settings of the so-called type-2 (which-key revealing) and type3 (which-key and length revealing) encryption schemes based on computational complexity.
Pedro Adão, Gergei Bana, Andre Scedrov
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where CSFW
Authors Pedro Adão, Gergei Bana, Andre Scedrov
Comments (0)