Computational and Information-Theoretic Soundness and Completeness of Formal Encryption

Authors:
Pedro Adao;Gergei Bana;Andre Scedrov
Affiliations:
Center for Logic and Computation - IST;University of Pennsylvania;University of Pennsylvania
Venue:
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Year:
2005

Citing 0
Cited 19

Security analysis of network protocols: logical and computational methods

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Perfect cryptography, S5 knowledge, and algorithmic knowledge

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Sound and complete computational interpretation of symbolic hashes in the standard model

Theoretical Computer Science
Computationally sound implementations of equational theories against passive adversaries

Information and Computation
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols

Formal to Practical Security
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage

Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Computational soundness of formal indistinguishability and static equivalence

ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Computational soundness of non-malleable commitments

ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Analysis of EAP-GPSK authentication protocol

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Formal proofs of cryptographic security of Diffie-Hellman-based protocols

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Computational soundness of equational theories

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Calibrating the power of schedulers for probabilistic polynomial-time calculus

Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Computationally sound analysis of protocols using bilinear pairings

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Inductive trace properties for computational security

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems

Journal of Automated Reasoning
Model based testing of cryptographic protocols

TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Soundness of formal encryption in the presence of key-cycles

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Computational soundness, co-induction, and encryption cycles

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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) andtype-3 (which-key and length revealing) encryption schemes based on computational complexity.