Several Proofs of Security for a Tokenization Algorithm
Cryptography and Security
2019-04-26 v3 Information Theory
math.IT
Abstract
In this paper we propose a tokenization algorithm of Reversible Hybrid type, as defined in PCI DSS guidelines for designing a tokenization solution, based on a block cipher with a secret key and (possibly public) additional input. We provide some formal proofs of security for it, which imply our algorithm satisfies the most significant security requirements described in PCI DSS tokenization guidelines. Finally, we give an instantiation with concrete cryptographic primitives and fixed length of the PAN, and we analyze its efficiency and security.
Cite
@article{arxiv.1609.00151,
title = {Several Proofs of Security for a Tokenization Algorithm},
author = {Riccardo Longo and Massimiliano Sala and Riccardo Aragona},
journal= {arXiv preprint arXiv:1609.00151},
year = {2019}
}
Comments
to appear in Applicable Algebra in Engineering, Communication and Computing