CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms

@inproceedings{Chichester2022CryptoSolveTA,
  title={CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms},
  author={Dalton Chichester and Wei Du and Raymond Kauffman and Hai Lin and Christopher Lynch and Andrew M. Marshall and Catherine A. Meadows and Paliath Narendran and Veena Ravishankar and Luis Rovira and Brandon Rozek},
  booktitle={International Symposium on Games, Automata, Logics and Formal Verification},
  year={2022}
}
Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable proofs of sound-ness/completeness, can be used both to identify insecure cryptosystems and prove sound ones secure. But although a number of such symbolic algorithms have been developed and implemented, they re-main scattered throughout the literature. In this paper, we present a tool, CryptoSolve, which provides a… 
[PDF] Semantic Reader

Figures and Tables from this paper

21 References

Fully automated analysis of padding-based encryption in the computational model

This paper presents proof systems for analyzing the chosen-plaintext and chosen-ciphertext security of public-key encryption schemes built from trapdoor permutations and hash functions in the random oracle model, and develops a toolset that bundles together fully automated proof and attack finding algorithms.

Linicrypt: A Model for Practical Cryptography

It is shown that indistinguishability of Linicrypt programs can be expressed as an existential formula, making the model amenable to automated program synthesis, and it is possible to use a SAT/SMT solver to automatically generate Linirypt programs satisfying a given security constraint.

A Complete Characterization of Security for Linicrypt Block Cipher Modes

It is proved that a Linicrypt block cipher mode is secure if and only if it is secure against adversaries who choose all-zeroes plaintexts, and is easy to check for a candidate mode.

Automated Analysis and Synthesis of Block-Cipher Modes of Operation

This work proposes an automated approach for the security analysis of block-cipher modes of operation based on a "local" analysis of the steps carried out by the mode when handling a single message block, and introduces a set of labels and constraints on the edges, and proves a meta-theorem showing that any mode for which there exists a labeling of the edges satisfying these constraints is secure.

Symbolic and Computational Reasoning About Cryptographic Modes of Operation

  • C. Meadows
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2020
In this paper we develop symbolic and computational representations for a class of cryptographic modes of operation, where the symbolic representations are modeled as elements of a term algebra, and…

Tweakable Block Ciphers

This work formalizes a cryptographic primitive, the “tweakable block cipher,” and suggests that tweakable block ciphers are easy to design, the extra cost of making a block cipher “Tweakable” is small, and it is easier to design and prove the security of applications of blockciphers that need this variability using tweakable blocks.

Computationally sound implementations of equational theories against passive adversaries

Automated Analysis and Synthesis of Authenticated Encryption Schemes

This work presents an automated approach for analyzing and synthesizing blockcipher-based AE schemes, significantly extending prior work by Malozemoff et al. (CSF 2014) who synthesize encryption schemes satisfying confidentiality only.

OCB: a block-cipher mode of operation for efficient authenticated encryption

It is proved OCB secure, quantifying the adversary's ability to violate the mode's privacy or authenticity in terms of the quality of its block cipher as a pseudorandom permutation (PRP) or as a strong PRP, respectively.

A Bunch of Broken Schemes: A Simple yet Powerful Linear Approach to Analyzing Security of Attribute-Based Encryption

This work systematize the methods to a linear approach to analyzing generic security of ABE, which is not only useful in analyzing existing schemes, but can also be applied during the design and reviewing of new schemes.