Abstract
We continue the study of sum-preserving encryption schemes, in which the plaintext and ciphertext are both integer vectors with the same sum. Such encryption schemes were recently constructed and analyzed by Tajik, Gunasekaran, Dutta, Ellia, Bobba, Rosulek, Wright, and Feng (NDSS 2019) in the context of image encryption. Our first main result is to prove a mixing-time bound for the construction given by Tajik et al. using path coupling. We then provide new sum-preserving encryption schemes by describing two practical ways to rank and unrank the values involved in sum-preserving encryption, which can then be combined with the rank-encipher-unrank technique from format-preserving encryption. Finally, we compare the efficiency of the Tajik et al. construction and our new ranking constructions based on performance tests we conducted on prototype implementations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Abramson, M.: Restricted combinations and compositions. Fibonacci Quart. 14, 439–452 (1976)
Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format-preserving encryption. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 295–312. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-05445-7_19
Boldyreva, A., Chenette, N., Lee, Y., O’Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 224–241. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01001-9_13
Brightwell, M., Smith, H.: Using datatype-preserving encryption to enhance data warehouse security. In: National Information Systems Security Conference (NISSC) (1997)
Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edn. Springer (2010)
Dworkin, M.: Recommendation for block cipher modes of operation: Methods for format preserving-encryption. NIST Special Publication 800–38G. https://doi.org/10.6028/NIST.SP.800-38G(2016)
Dyer, M., Greenhill, C.: A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms 13, 285–317 (1998)
El Kahoui, M., Rakrak, S.: Structure of Grobner bases with respect to block orders. Math. Comput. 76, 2181–2187 (2007). https://doi.org/10.1090/S0025-5718-07-01972-2
Hoang, V.T., Rogaway, P.: On generalized Feistel networks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 613–630. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_33
Institute, A.N.S.: Financial services - symmetric key cryptography for the financial services industry - format-preserving encryption. ANSI X9.124 Standard (2020). https://webstore.ansi.org/standards/ascx9/ansix91242020
Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society (2006)
Marohn, B., Wright, C.V., Feng, W., Rosulek, M., Bobba, R.B.: Approximate thumbnail preserving encryption. In: Multimedia Privacy and Security - MPS@CCS 2017, pp. 33–43. ACM (2017)
Opdyke, J.: A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions. J. Math. Modelling Algorithms 9, 53–97 (2010). https://doi.org/10.1007/s10852-009-9116-2
Page, D.R.: Generalized algorithm for restricted weak composition generation. J. Math. Modelling Algorithms Oper. Res. 12(4), 345–372 (2012). https://doi.org/10.1007/s10852-012-9194-4
Riordan, J.: An Introduction to Combinatorial Analysis. Dover Publications, Inc. (1980). https://doi.org/10.1515/9781400854332
Shrimpton, T., Terashima, R.S.: A modular framework for building variable-input-length tweakable ciphers. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 405–423. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-42033-7_21
Stein, T.: Uniform random samples for second-order restricted k-compositions. January 2020. http://essay.utwente.nl/80718/
Tajik, K., et al.: Balancing image privacy and usability with thumbnail-preserving encryption. In: NDSS 2019. The Internet Society, February 2019
Walsh, T.: Loop-free sequencing of bounded integer compositions. JCMCC. J. Combinat. Math. Combinat. Comput. 33, 323–345 (2000)
Wright, C.V., Feng, W., Liu, F.: Thumbnail-preserving encryption for JPEG. In: ACM Workshop on Information Hiding and Multimedia Security - IH &MMSec 2015, pp. 141–146. ACM (2015)
Acknowledgements
We thank the anonymous Asiacrypt 2022 reviewers for providing detailed comments and suggestions for improving the presentation of our results.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 International Association for Cryptologic Research
About this paper
Cite this paper
Miracle, S., Yilek, S. (2022). New Algorithms and Analyses for Sum-Preserving Encryption. In: Agrawal, S., Lin, D. (eds) Advances in Cryptology – ASIACRYPT 2022. ASIACRYPT 2022. Lecture Notes in Computer Science, vol 13793. Springer, Cham. https://doi.org/10.1007/978-3-031-22969-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-22969-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-22968-8
Online ISBN: 978-3-031-22969-5
eBook Packages: Computer ScienceComputer Science (R0)