4.2 Article

DESIGNING TWEAKABLE ENCIPHERING SCHEMES USING PUBLIC PERMUTATIONS

Journal

Publisher

AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/amc.2021021

Keywords

Tweakable enciphering schemes; public permutation; HCTR; tweak-able strong pseudorandom permutation; modes of operations; H-coefficient

Ask authors/readers for more resources

The paper discusses constructing a tweakable enciphering scheme using public random permutations, proposing a specific construction method for a single-keyed TES.
A tweakable enciphering scheme (TES) is a length preserving (tweakable) encryption scheme that provides (tweakable) strong pseudorandom permutation security on arbitrarily long messages. TES is traditionally built using block ciphers and the security of the mode depends on the strong pseudorandom permutation security of the underlying block cipher. In this paper, we construct TESs using public random permutations. Public random permutations are being considered as a replacement of block cipher in several cryptographic schemes including AEs, MACs, etc. However, to our knowledge, a systematic study of constructing TES using public random permutations is missing. In this paper, we give a generic construction of a TES which uses a public random permutation, a length expanding public permutation based PRF and a hash function which is both almost xor universal and almost regular. Further, we propose a concrete length expanding public permutation based PRF construction. We also propose a single keyed TES using a public random permutation and an AXU and almost regular hash function.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available