Academic
Publications
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage

Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage,10.3233/JCS-2009-0358,Journal of Computer Sec

Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage   (Citations: 2)
BibTex | RIS | RefWorks Download
In their seminal work, Abadi and Rogaway (2, 3) show that the formal (Dolev-Yao) notion of indistinguishability is sound with respect to the computa- tional model: messages that are indistinguishable in the formal model become in- distinguishable messages in the computational model. However, this result leaves two problems unsolved. First, it cannot tolerate key cycles. Second, it makes the too-strong assumption that the underlying cryptography hides all aspects of the plaintext, including its length. In this paper we extend their work in order to ad- dress these problems. We show that the recently-introduced notion of KDM-security can provide sound- ness even in the presence of key cycles. For this, we have to consider encryption that reveals the length of plaintexts, which we use to motivate a general exami- nation information-leaking encryption. In particular, we consider the conditions under which an encryption scheme that may leak some partial information will provide soundness and completeness to some (possibly weakened) version of the formal model.
Journal: Journal of Computer Security - JCS , vol. 17, no. 5, pp. 737-797, 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...These works were motivated by the fundamental nature of the question as well as by concrete applications including encrypted storage systems (e.g., BitLocker [12]), anonymous credentials [16], and realization of security proofs at the framework of axiomatic security [1,11,3]...

    Benny Applebaum. Key-Dependent Message Security: Generic Amplification and Completeness

    • ... [31]; particle statistics in quantum information [61, 60]; quantum walks and their comparison with random walks [62]; quantum algorithms for searching [49] and in logic; quantum automata and their minimization and interconnection; quantum transition systems for model checking of quantum systems [7]; quantum logic [51, 52, 54, 53, 55, 26, 19, 25] for model checking of quantum systems; formal methods in security [21, 23, 20, 22, 4, 3, 2, 5]; ...

    Amílcar Sernadaset al. Quantum Computation and Information

Sort by: