Secure Compression: Theory \& Practice
نویسندگان
چکیده
Encryption and compression are frequently used together in both network and storage systems, for example in TLS. Despite often being used together, there has not been a formal framework for analyzing these combined systems; moreover, the systems are usually just a simple chaining of compression followed by encryption. In this work, we present the first formal framework for proving security in combined compression-encryption schemes and relate it to the traditional notion of semantic security. We call this entropy-restricted semantic security. Additionally, we present a new, efficient cipher, called the squeeze cipher, that combines compression and encryption into a single primitive and provably achieves our entropy-restricted security.
منابع مشابه
A New Digital Image Compression Algorithm Based on Nonlinear Dynamical Systems
In this paper we discuss the formulation of, and show the results for, a new compression/decompression algorithm called DYNAMAC, that has its basis in nonlinear systems theory. We show that we are able to achieve significant compression of RGB image data while maintaining good image quality. We discuss the implementation of this algorithm in hardware, show that the same process is applicable to...
متن کاملConstruction of secure and fast hash functions using nonbinary error-correcting codes
This paper considers iterated hash functions. It proposes new constructions of fast and secure compression functions with -bit outputs for integers 1 based on error-correcting codes and secure compression functions with -bit outputs. This leads to simple and practical hash function constructions based on block ciphers such as Data Encryption Standard (DES), where the key size is slightly smalle...
متن کاملSource coding under security constraints
Information theoretic security characterizes the fundamental limitations of unconditional security against computationally unbounded adversaries. In this chapter, secure distributed compression in the presence of eavesdropper(s) is considered from the information theoretic security perspective. Basic models and fundamental results are summarized for lossless and lossy source compression. Distri...
متن کاملHash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preimage security. Despite their elegance and simplicity, these designs are not covered by the results of Rogaway and Steinberger (CRYPTO 2008). By defining a carefully chosen equivalence relation on this family of compress...
متن کاملAnalytical predictions for the buckling of a nanoplate subjected to non-uniform compression based on the four-variable plate theory
In the present study, the buckling analysis of the rectangular nanoplate under biaxial non-uniform compression using the modified couple stress continuum theory with various boundary conditions has been considered. The simplified first order shear deformation theory (S-FSDT) has been employed and the governing differential equations have been obtained using the Hamilton’s principle. An analytic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014