Automated proof for formal indistinguishability and its applications

Ngo, Long, Boyd, Colin, & Gonzalez Nieto, Juan M. (2011) Automated proof for formal indistinguishability and its applications. In The 7th Workshop on Formal and Computational Cryptography (FCC 2011), 30 June 2011, Institut Henri Poincaré, Paris. (Unpublished)

View at publisher


Bana et al. proposed the relation formal indistinguishability (FIR), i.e. an equivalence between two terms built from an abstract algebra. Later Ene et al. extended it to cover active adversaries and random oracles. This notion enables a framework to verify computational indistinguishability while still offering the simplicity and formality of symbolic methods.

We are in the process of making an automated tool for checking FIR between two terms. First, we extend the work by Ene et al. further, by covering ordered sorts and simplifying the way to cope with random oracles. Second, we investigate the possibility of combining algebras together, since it makes the tool scalable and able to cover a wide class of cryptographic schemes. Specially, we show that the combined algebra is still computationally sound, as long as each algebra is sound. Third, we design some proving strategies and implement the tool. Basically, the strategies allow us to find a sequence of intermediate terms, which are formally indistinguishable, between two given terms. FIR between the two given terms is then guaranteed by the transitivity of FIR. Finally, we show applications of the work, e.g. on key exchanges and encryption schemes. In the future, the tool should be extended easily to cover many schemes.

This work continues previous research of ours on use of compilers to aid in automated proofs for key exchange.

Impact and interest:

Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

565 since deposited on 11 Jul 2011
467 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 42552
Item Type: Conference Item (Presentation)
Refereed: Yes
Keywords: Indistinguishability, automated proof, Computational soundness, universal algebra
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTER SOFTWARE (080300) > Computer System Security (080303)
Divisions: Past > Institutes > Information Security Institute
Copyright Owner: Copyright 2011 the Authors
Deposited On: 11 Jul 2011 22:48
Last Modified: 11 Jul 2011 22:52

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page