Sciweavers

72 search results - page 1 / 15
» Computational and Information-Theoretic Soundness and Comple...
Sort
View
CSFW
2005
IEEE
15 years 11 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...
Pedro Adão, Gergei Bana, Andre Scedrov
164
Voted
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
15 years 10 months ago
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...
Omer Horvitz, Virgil D. Gligor
117
Voted
ESOP
2005
Springer
15 years 11 months ago
Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries
Romain Janvier, Yassine Lakhnech, Laurent Mazar&ea...