Updatable tokenization: formal definitions and provably secure constructions

DOI10.1007/978-3-319-70972-7_4MaRDI QIDQ5854427zbMATH OpenOpenAlexFDO

Authors Christian Cachin, Jan Camenisch, Eduarda Freire-Stögbuchner, Anja Lehmann

Publication date 17 March 2021

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-70972-7_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Several proofs of security for a tokenization algorithm
• Fast and secure updatable encryption
• (R)CCA secure updatable encryption with integrity protection
• Updatable encryption with post-compromise security
• FAST: secure and high performance format-preserving encryption and tokenization

Cites work

• Deterministic and Efficiently Searchable Encryption
• scientific article; zbMATH DE number 1303118 (Why is no real title available?)
• Key homomorphic PRFs and their applications

Cited in

(3)

• Several proofs of security for a tokenization algorithm
• Fast and secure updatable encryption
• Update semantics of security protocols

This page was built for publication: Updatable tokenization: formal definitions and provably secure constructions

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