Several proofs of security for a tokenization algorithm

DOI10.1007/S00200-017-0313-3zbMATH Open1386.94063arXiv1609.00151OpenAlexW3099946652WikidataQ113906112 ScholiaQ113906112MaRDI QIDQ1683979FDOQ1683979

Authors: Riccardo Aragona, Riccardo Longo, Massimiliano Sala 

Publication date: 4 December 2017

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1609.00151

Recommendations

• Updatable tokenization: formal definitions and provably secure constructions
• FAST: secure and high performance format-preserving encryption and tokenization
• On cryptographic properties of the \(CVV\) and \(PVV\) parameters generation procedures in payment systems
• A Generic Construction for Token-Controlled Public Key Encryption
• Token-Controlled Public Key Encryption in the Standard Model

zbMATH Keywords

provable securityblock ciphersIND CPA securitytokenization

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Tweakable block ciphers
• How to Encipher Messages on a Small Domain
• Format-preserving encryption
• An enciphering scheme based on a card shuffle

Cited In (3)

• Title not available (Why is that?)
• On cryptographic properties of the \(CVV\) and \(PVV\) parameters generation procedures in payment systems
• Updatable tokenization: formal definitions and provably secure constructions

Uses Software

• NIST Statistical Test Suite

This page was built for publication: Several proofs of security for a tokenization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683979)