A Study of Format-Preserving Encryption Algorithm Incorporating Robust Chinese Remainder Theorem
Authors: 
Ke Luo, Wei GaoAuthors Info & Claims
Ke Luo, Wei GaoAuthors Info & ClaimsPages 367 - 370
Abstract
Given that the current preservation format structure is too short in terms of the number of input bits in the plaintext, its security cannot be fully guaranteed. In this paper, a Closed-form robust Chinese remainder theorem-based preservation format encryption algorithm is proposed, in which multiple sensitive data fields are first combined into plaintext according to the Closed-form robust Chinese remainder theorem, and the plaintext is encrypted in the preservation format, while the sensitive data is retrieved through the Closed-form robust Chinese remainder theorem for specific data retrieval. The experimental results show that the security performance of the Closed-form robust Chinese Remainder Theorem-based format-preserving encryption algorithm is further improved.
References
[1]
N. T. Courtois, J. Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations, International Conference on the Theory and Application.International Conference on the Theory and Application of Cryptology and Information Security, pp. 267–287, Springer, 2002.
[2]
S. T. Format preserving encryption. Unpublished Voltage White Paper, 2008.
[3]
T. Spies. Feistel finite set encryption mode. NIST Proposed Encryption Mode. Available online at http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/ffsem/ffsem-spec. pdf, 2008.23.
[4]
M. Bellare, T. Ristenpart, P. Rogaway, T. Stegers, Format-preserving encryption. International Workshop on Selected Areas in Cryptography, pp. 295–312,Springer, 2009.
[5]
M. Bellare, P. Rogaway, T. Spies. The ffx mode of operation for formatpreserving encryption. NIST submission, vol. 20, 2010.
[6]
B. Morris, P. Rogaway, T. Stegers. How to encipher messages on a small domain. Advances in Cryptology-CRYPTO 2009, pp. 286–302, Springer, 2009.of Cryptology and Information Security, pp. 267–287, Springer, 2002.
[7]
J. Black, P. Rogaway. Ciphers with arbitrary finite domains. Cryptographers’ Track at the RSA Conference, pp. 114–130, Springer, 2002.
[8]
S. Vidhya, K. Chitra. Survey of format preserving encryption. International Journal Of Computational Engineering Research, 2012.
[9]
S. Vidhya, K. Chitra. Enhancement of prefix cipher in format preserving encryption. International Journal of Engineering Inventions, 2013.
[10]
S. Vidhya, K. Chitra. Format preserving encryption using feistel cipher. International Conference on Research Trends in Computer Technology, ICRTCT-2013, in Proceeding of International Journal of Computer Application (IJCA), pp. 5–8, 2013.
[11]
K. Chitra. Efficient fpe algorithm for encrypting credit card numbers. IOSR Journal of Computer Engineering, vol. 14,pp. 23–29, 01 2013.24.
[12]
E. Brier, T. Peyrin, J. Stern, Bps. a format-preserving encryption proposal. http://csrc. nist. gov/groups/ST/toolkit/BCM/documents/proposedmodes/bps/bpsspec. pdf, 2010.
[13]
C. Jia, Z. Liu, J. Li, Z. Dong, X. You. A new integer fpe scheme based on feistel network. Advances in Electric and Electronics, pp. 637–644, Springer, 2012.
[14]
Z. Liu, C. Jia, J. Li, X. Cheng. Format-preserving encryption for datetime, in Intelligent Computing and Intelligent Systems (ICIS). 2010 IEEE International Conference on, vol. 2, pp. 201–205, IEEE, 2010.4.
[15]
Z. Bhatt, V. Gupta, Advance security technique for format preserving encryption, in Inventive Computation Technologies (ICICT). International Conference on, vol. 1, pp. 1–4, IEEE, 2016.
[16]
S. Liang, Y. Zhang, J. Guo, C. Dong, Z. Liu, C. Jia. Efficient format-preserving encryption mode for integer. in Computational Science and Engineering (CSE) and Embedded and Ubiquitous Computing (EUC), 2017 IEEE International Conference on, vol. 2, pp. 96–102, IEEE, 2017.
[17]
B. Cui, B. Zhang, K. Wang. A data masking scheme for sensitive big data based on format-preserving encryption. in Computational Science and Engineering (CSE) and Embedded and Ubiquitous Computing (EUC), 2017 IEEE International Conference on, vol. 1, pp. 518–524, IEEE, 2017.
[18]
M. Luby, C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, vol. 17, no. 2, pp. 373–386, 1988.
[19]
[19] W. J. Wang, X.-G. Xia. A closed-form robust Chinese remainder theorem and its performance analysis. IEEE Trans. Signal Process., vol. 58, no. 11, pp. 5655–5666, Nov. 2010.
[20]
[20] M. Luby, C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, vol. 17, no. 2, pp.373–386,1988.
- A Study of Format-Preserving Encryption Algorithm Incorporating Robust Chinese Remainder Theorem
Recommendations
Identity-Based Format-Preserving Encryption
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityWe introduce identity-based format-preserving encryption (IB-FPE) as a way to localize and limit the damage to format-preserving encryption (FPE) from key exposure. We give definitions, relations between them, generic attacks and two transforms of FPE ...
Robust threshold schemes based on the Chinese remainder theorem
AFRICACRYPT'08: Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptologyRecently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are ...
A closed-form robust chinese remainder theorem and its performance analysis
Chinese remainder theorem (CRT) reconstructs an integer from its multiple remainders that is well-known not robust in the sense that a small error in a remainder may cause a large error in the reconstruction. A robust CRT has been recently proposed when ...
Comments
Information & Contributors
Information
Published In
October 2021
3136 pages
ISBN:9781450385046
DOI:10.1145/3495018
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 March 2022
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
AIAM2021
AIAM2021: 2021 3rd International Conference on Artificial Intelligence and Advanced Manufacture
October 23 - 25, 2021
Manchester, United Kingdom
Acceptance Rates
Overall Acceptance Rate 100 of 285 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 40Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)2
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format