The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
From MaRDI portal
Publication:2845685
DOI10.1007/978-3-642-40041-4_22zbMath1310.94167OpenAlexW196598226MaRDI QIDQ2845685
Scott Yilek, Thomas Ristenpart
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_22
Related Items (9)
Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ eSPF: A Family of Format-Preserving Encryption Algorithms Using MDS Matrices ⋮ Format-Preserving Encryption Algorithms Using Families of Tweakable Blockciphers ⋮ Partition and mix: generalizing the swap-or-not shuffle ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Reverse Cycle Walking and Its Applications ⋮ Targeted ciphers for format-preserving encryption ⋮ Deterministic encryption with the Thorp shuffle ⋮ Modifying an Enciphering Scheme After Deployment
This page was built for publication: The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries