IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v16y2024i6p210-d1415475.html
   My bibliography  Save this article

Reversible Data Hiding in Encrypted 3D Mesh Models Based on Multi-Group Partition and Closest Pair Prediction

Author

Listed:
  • Xu Wang

    (School of Information Science and Engineering, University of Jinan, Jinan 250022, China
    Department of Information Engineering and Computer Science, Feng Chia University, 100 Wenhwa Road, Seatwen, Taichung 40724, Taiwan)

  • Jui-Chuan Liu

    (Department of Information Engineering and Computer Science, Feng Chia University, 100 Wenhwa Road, Seatwen, Taichung 40724, Taiwan)

  • Ching-Chun Chang

    (Department of Computer Science, University of Warwick, Coventry CV47AL, UK)

  • Chin-Chen Chang

    (Department of Information Engineering and Computer Science, Feng Chia University, 100 Wenhwa Road, Seatwen, Taichung 40724, Taiwan)

Abstract

The reversible data hiding scheme in the encrypted domain is a potential solution to the concerns regarding user privacy in cloud applications. The 3D mesh model is an emerging file format and is widely used in engineering modeling, special effects, and video games. However, studies on reversible data hiding in encrypted 3D mesh models are still in the preliminary stage. In this paper, two novel techniques, multi-group partition (MGP) and closest pair prediction (CPP), are proposed to improve performance. The MGP technique adaptively classifies vertices into reference and embeddable vertices, while the CPP technique efficiently predicts embeddable vertices and generates shorter recovery information to vacate more redundancy for additional data embedding. Experimental results indicate that the proposed scheme significantly improves the embedding rate compared to state-of-the-art schemes and can be used in real-time applications.

Suggested Citation

  • Xu Wang & Jui-Chuan Liu & Ching-Chun Chang & Chin-Chen Chang, 2024. "Reversible Data Hiding in Encrypted 3D Mesh Models Based on Multi-Group Partition and Closest Pair Prediction," Future Internet, MDPI, vol. 16(6), pages 1-14, June.
    • Handle: RePEc:gam:jftint:v:16:y:2024:i:6:p:210-:d:1415475
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/16/6/210/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/16/6/210/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:16:y:2024:i:6:p:210-:d:1415475. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.