Cloud Computing, Security, Privacy in New Computing Environments. 7th International Conference, CloudComp 2016, and First International Conference, SPNCE 2016, Guangzhou, China, November 25–26, and December 15–16, 2016, Proceedings

Research Article

Generalized Format-Preserving Encryption for Character Data

  • @INPROCEEDINGS{10.1007/978-3-319-69605-8_11,
        author={Yanyu Huang and Bo Li and Shuang Liang and Haoyu Ma and Zheli Liu},
        title={Generalized Format-Preserving Encryption for Character Data},
        proceedings={Cloud Computing, Security, Privacy in New Computing Environments. 7th International Conference, CloudComp 2016, and First International Conference, SPNCE 2016, Guangzhou, China, November 25--26, and December 15--16, 2016, Proceedings},
        proceedings_a={CLOUDCOMP},
        year={2017},
        month={11},
        keywords={Block ciphers Format-preserving encryption Feistel networks FFX mode Mixed-radix numeral systems},
        doi={10.1007/978-3-319-69605-8_11}
    }
    
  • Yanyu Huang
    Bo Li
    Shuang Liang
    Haoyu Ma
    Zheli Liu
    Year: 2017
    Generalized Format-Preserving Encryption for Character Data
    CLOUDCOMP
    Springer
    DOI: 10.1007/978-3-319-69605-8_11
Yanyu Huang1,*, Bo Li1,*, Shuang Liang1,*, Haoyu Ma2,*, Zheli Liu1,*
  • 1: Nankai University
  • 2: Xidian University
*Contact email: onlyerir@163.com, nankailibo@163.com, nk_liangshuang@163.com, ma-haoyu@163.com, liuzheli1978@163.com

Abstract

We studied the problem on applying format-preserving encryption (FPE) to character data, specifically the uncertainty of the binary size of ciphertexts caused by variable-width encoding. In this paper, we suggested a extended rank-then-encipher approach for character data which connects character strings with numbers under mixed-radix numeral system. Based on this method, we proposed a generic character FPE scheme that deals with mixed-radix numerals, by introducing a customized “dynamic modulo addition” into unbalanced Feistel construction. Our work showed a new way of designing encryption methods for arbitrary message spaces which involves no tradeoff between efficacy and efficiency. Besides describing our design, security of our schemes are also analyzed.