An enciphering scheme based on a card shuffle

DOI10.1007/978-3-642-32009-5_1MaRDI QIDQ2914246zbMATH OpenOpenAlexFDO

Authors Viet Tung Hoang, Ben Morris, Phillip Rogaway

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

blockciphersFeistel networkLuby-RackoffMarkov chainPRF-to-PRP conversionpseudorandom permutationsswap-or-not

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom permutation (PRP) (or, alternatively, to directly build a confusion/diffusion blockcipher). We then prove that swap-or-not has excellent quantitative security bounds, giving a Luby-Rackoff type result that ensures security (assuming an ideal round function) to a number of adversarial queries that is nearly the size of the construction's domain. Swap-or-not provides a direct solution for building a small-domain cipher and achieving format-preserving encryption, yielding the best bounds known for a practical scheme for enciphering credit-card numbers. The analysis of swap-or-not is based on the theory of mixing times of Markov chains.

Recommendations

• Partition and mix: generalizing the swap-or-not shuffle
• How to Encipher Messages on a Small Domain
• The mix-and-cut shuffle: small-domain encryption secure against N queries
• Deterministic encryption with the Thorp shuffle
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time

Cited in

(24)

• Several proofs of security for a tokenization algorithm
• Cycle slicer: an algorithm for building permutations on special domains
• Targeted ciphers for format-preserving encryption
• Deterministic encryption with the Thorp shuffle
• Compact proofs of retrievability
• Hardness-preserving reductions via cuckoo hashing
• The mix-and-cut shuffle: small-domain encryption secure against N queries
• Format-preserving encryption algorithms using families of tweakable blockciphers
• Reverse cycle walking and its applications
• How to Encipher Messages on a Small Domain
• scientific article; zbMATH DE number 5773656 (Why is no real title available?)
• Leakage-resilient riffle shuffle
• eSPF: A Family of Format-Preserving Encryption Algorithms Using MDS Matrices
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• Partition and mix: generalizing the swap-or-not shuffle
• Targeted invertible pseudorandom functions and deterministic format-transforming encryption
• Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
• New algorithms and analyses for sum-preserving encryption
• Card-Based Secure Sorting Protocol
• Efficient pre-processing PIR without public-key cryptography
• On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
• Are your keys protected? Time will tell
• Pseudorandom functions with weak programming privacy and applications to private information retrieval
• Single-server client preprocessing PIR with tight space-time trade-off

This page was built for publication: An enciphering scheme based on a card shuffle

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