Cited by 18Chaos-based Image/Signal EncryptionComputer Science and EngineeringAdvanced Data Compression Techniques

A block-permutation-based encryption scheme with independent processing of RGB components

Open access
IMAIZUMI, Shoko, KIYA, Hitoshi·2018·IEICE Transactions on Information and Systems

Abstract

This paper proposes a block-permutation-based encryption (BPBE) scheme for the encryption-then-compression (ETC) system that enhances the color scrambling.A BPBE image can be obtained through four processes, positional scrambling, block rotation/flip, negativepositive transformation, and color component shuffling, after dividing the original image into multiple blocks.The proposed scheme scrambles the R, G, and B components independently in positional scrambling, block rotation/flip, and negative-positive transformation, by assigning different keys to each color component.The conventional scheme considers the compression efficiency using JPEG and JPEG 2000, which need a color conversion before the compression process by default.Therefore, the conventional scheme scrambles the color components identically in each process.In contrast, the proposed scheme takes into account the RGB-based compression, such as JPEG-LS, and thus can increase the extent of the scrambling.The resilience against jigsaw puzzle solver (JPS) can consequently be increased owing to the wider color distribution of the BPBE image.Additionally, the key space for resilience against brute-force attacks has also been expanded exponentially.Furthermore, the proposed scheme can maintain the JPEG-LS compression efficiency compared to the conventional scheme.We confirm the effectiveness of the proposed scheme by experiments and analyses.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1587/transinf.2018edt0002

Cites

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The correlation among blocks in cipher-images may still facilitate optimizing attacks on block-wise permutation schemes with advanced jigsaw puzzle solvers.

    “But, the correlation among blocks in cipher-images may still facilitate optimizing the attacking on the block-wise permutation schemes analyzed in [114,115] with the advanced jigsaw puzzle solvers.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

No references could be resolved yet.

Research works printed but not linked: 21

  1. M. Kumar and A. Vaish, "An Efficient Encryption-then-Compres- sion Technique for Encrypted Images Using SVD," Digital Signal Processing, vol.60, pp.81-89, 2017. · DOI
  2. J. Zhou, X. Liu, O.C. Au, and Y.Y. Tang, "Designing an Effi- cient Image Encryption-Then-Compression System via Prediction Error Clustering and Random Permutation," IEEE Trans. Informa- tion Forensics and Security, vol.9, no.1, pp.39-50, 2014. · DOI · Paper page
  3. W. Liu, W. Zeng, L. Dong, and Q. Yao, "Efficient Compression of Encrypted Gray-Scale Images," IEEE Trans. Image Process., vol.19, no.4, pp.1097-1102, 2010. · DOI
  4. M. Johnson, P. Ishwar, V. Prabhakaran, D. Schinberg, and K. Ramchandran, "On Compressing Encrypted Data," IEEE Trans. Sig- nal Process., vol.52, no.10, pp.2992-3006, 2004. · DOI
  5. K. Kurihara, S. Imaizumi, S. Shiota, and H. Kiya, "An Encryp- tion-then-Compression System for Lossless Image Compression Standards," IEICE Trans. Inf. & Syst., vol.E100-D, no.1, pp.52-56, 2017. · DOI
  6. K. Kurihara, O. Watanabe, and H. Kiya, "An Encryption-then- Compression System for JPEG XR Standard," Proc. IEEE Interna- tional Symposium on Broadband Multimedia Systems and Broad- casting (BMSB), pp.1-5, 2016. · DOI
  7. K. Kurihara, M. Kikuchi, S. Imaizumi, S. Shiota, and H. Kiya, "An Encryption-then-Compression System for JPEG/Motion JPEG Standard," IEICE Trans. Fundamentals, vol.E98-A, no.11, pp.2238-2245, 2015. · DOI
  8. O. Watanabe, A. Uchida, T. Fukuhara, and H. Kiya, "An Encryption- then-Compression System for JPEG 2000 Standard," Proc. IEEE ICASSP, pp.1226-1230, 2015. · DOI
  9. D. Sholomon, O.E. David, and N.S. Netanyahu, "An Automatic Solver for Very Large Jigsaw Puzzles using Genetic Algorithms," Genetic Programming and Evolvable Machines, vol.17, no.3, pp.291-313, 2016. · DOI
  10. A.C. Gallagher, "Jigsaw Puzzles with Pieces of Unknown Orienta- tion," Proc. CVPR, pp.382-389, 2012. · DOI
  11. K. Son, D. Moremo, J. Hays, and D.B. Cooper, "Solving Small- Piece Jigsaw Puzzles by Growing Consensus," Proc. CVPR, pp.1193-1201, 2016. · DOI
  12. G. Paikin and A. Tal, "Solving Multiple Square Jigsaw Puzzles with Missing Pieces," Proc. CVPR, pp.4832-4839, 2015. · DOI
  13. K. Son, J. Hays, and D.B. Cooper, "Solving Square Jigsaw Puzzles with Loop Constraints," Proc. ECCV, vol.8694, pp.32-46, 2014. · DOI
  14. D. Pomeranz, M. Shemesh, and O. Ben-Shahar, "A Fully Automated Greedy Square Jigsaw Puzzle Solver," Proc. CVPR, pp.9-16, 2011. · DOI
  15. T.S. Cho, S. Avidan, and W.T. Freeman, "A Probabilistic Image Jig- saw Puzzle Solver," Proc. CVPR, pp.183-190, 2010. · DOI
  16. M.J. Weinberger, G. Seroussi, and G. Sapiro, "The LOCO-I Lossless Image Compression Algorithm: Principles and Standardization into JPEG-LS," IEEE Trans. Image Process., vol.9, no.8, pp.1309-1324, 2000. · DOI
  17. T. Chuman, K. Kurihara, and H. Kiya, "On the Security of Block Scrambling-Based EtC Systems against Extended Jigsaw Puzzle Solver Attacks," IEICE Trans. Inf. & Syst., vol.E101-D, no.1, pp.37-44, 2018. · DOI
  18. T. Chuman, K. Kurihara, and H. Kiya, "On the Security of Block Scrambling-based ETC Systems against Jigsaw Puzzle Solver At- tacks," Proc. ICASSP, pp.2157-2161, 2017. · DOI
  19. T. Chuman, K. Kurihara, and H. Kiya, "Security evaluation for block scrambling-based etc systems against extended jigsaw puzzle solver attacks," Proc. ICME, pp.229-234, 2017. · DOI
  20. W. Sirichotedumrong, T. Chuman, S. Imaizumi, and H. Kiya, "Grayscale-Based Block Scrambling Image Encryption for Social Networking Services," Proc. ICME, 2018.
  21. R. Yu, C. Russell, and L. Agapito, "Solving Jigsaw Puzzles with Linear Programming," arXiv preprint arXiv:1511.04472, 2015. · arXiv

Cited by

Sorted by citations

Authors
IMAIZUMI, S., & KIYA, H.
Affiliations
Chiba University (JP)
Venue
IEICE Transactions on Information and Systems
Published
2018-12-01
Volume
E101.D
Issue
12
Pages
3150-3157
ISSN
  • 0916-8532 (ISSN-L)
  • 1745-1361
OpenAlex
W2902017599
Cited by
18
References
0
Citations by year
2026: 3 · 2025: 1 · 2024: 3 · 2023: 2 · 2022: 4 · 2021: 1 · 2020: 2 · 2019: 1 · 2018: 1
FWCI
0.63
Type
journal article
Language
en
Open access
Locations
  • IEICE Transactions on Information and Systems (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Japan Society for the Promotion of Science (17H03267)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
Keywords
image encryption, encryption-then-compression, JPEG-LS, brute-force attack resistance, key space expansion

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review