Targeted Ciphers for Format-Preserving Encryption

Miracle, Sarah; Yilek, Scott

doi:10.1007/978-3-030-10970-7_1

Cited by 2 publications

(6 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thereby, under the condition that ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffi ffiffi 32jX j þ 17 2 p − 17 ≤ jSj ≤ jX j=6 and m > 2 6 , we have…”

Section: Lemma 1 For All Integersunclassified

“…Meanwhile, in the case where

false| scriptS false| < false| scriptX false| / 2

, they also found an equivalent matching exchange process for MSU without bit flips. Removing those bit flips improves the efficiency of MSU [6].…”

Section: Preliminariesmentioning

confidence: 99%

“…In the beginning, Miracle and Yilek provided a particular matching exchange process with Pr[ k = i ] = p i , where p i is given by Equation (). In Equation (), G i is the probability that a particular matching of size i on

scriptS

is selected by MSU [6]. Equation () shows how G i is calculated.…”

Section: Preliminariesmentioning

confidence: 99%

“…Note that in Miracle and Yilek's paper [6], another symbol,

{scriptM}_{i}^{m}

, is used without explanation. After analysing their idea and proofs carefully, we can confirm that

{scriptM}_{i}^{m}

is exactly

(\begin{matrix} 2 m \\ 2 i \end{matrix}) {scriptM}_{i}

.…”

Section: Preliminariesmentioning

confidence: 99%

“…One is domain targeting [5], which asks to construct a cipher on domain S by using a cipher on larger domain X ⊃ S. A former solution named Cycle Slicer [5] can achieve this goal but is inefficient. Later, Miracle and Yilek presented a new targeted cipher called Mix-Swap-Unmix (MSU) [6]. MSU is more practical than Cycle Slicer while achieving the same security level.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Comment on ‘Targeted Ciphers for Format‐Preserving Encryption’ from Selected Areas in Cryptography 2018

Wang

Ping

2021

IET Information Security

View full text Add to dashboard Cite

Format-preserving encryption (FPE) allows encrypting plaintexts while preserving a specific format. In Selected Areas in Cryptography 2018, two targeted ciphers were proposed as new FPE schemes. The second scheme was designed with an algorithm called Mix-Swap-Unmix that is shown to be equivalent to a particular matching exchange process under a specific setting. In this comment paper, we prove that the matching exchange process is invalid. As a result, this equivalence does not exist. The matching exchange process is proposed by Czumaj and Kutyłowski to permute items at random in parallel andThis is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Section: Lemma 1 For All Integersunclassified

“…Meanwhile, in the case where