Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Artículo Open Access |
| Published: |
Wiley
2026
|
| Subjects: | |
| Online Access: | https://onlinelibrary.wiley.com/doi/10.1002/cpe.70708 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1867012802736029696 |
|---|---|
| author | Bing Chen Ranran Yang Bingwen Feng Xiuye Zhan Jun Cai |
| author_facet | Bing Chen Ranran Yang Bingwen Feng Xiuye Zhan Jun Cai Bing Chen Ranran Yang Bingwen Feng Xiuye Zhan Jun Cai |
| collection | Wiley Open Access |
| contents | Additional‐Processing‐Free Multiparty Reversible Data Hiding Over Encrypted Domain Bing Chen Ranran Yang Bingwen Feng Xiuye Zhan Jun Cai Concurrency and Computation: Practice and Experience ABSTRACT Multiparty reversible data hiding over encrypted domain (MRDH‐ED) provides a safeguard mechanism that enables the restoration of the original cover even if some of the data hiders are potentially compromised. Existing MRDH‐ED methods are accompanied by additional processing in the cover encryption procedure, which results in high computational consumption. In this paper, an additional‐processing‐free MRDH‐ED method with compatibility is given. The original cover is encrypted into multiple encrypted covers by using a composite‐order secret sharing. Additive operation over the composite‐order finite field is employed to embed secret data into each encrypted cover. Since the original cover can be encrypted without additional processing in the cover encryption procedure, the computational consumption is reduced. And the embedding capacity is improved, regardless of the distribution of the covers. With the help of the composite‐order secret sharing, the proposed method is compatible with other bit‐level covers. The proposed scheme's superiority is demonstrated through the presentation of experimental results. 10.1002/cpe.70708 http://onlinelibrary.wiley.com/termsAndConditions#vor |
| doi_str_mv | 10.1002/cpe.70708 |
| format | Artículo Open Access |
| id | wiley_oa_10_1002_cpe_70708 |
| institution | Wiley Open Access |
| license_str_mv | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| publishDate | 2026 |
| publisher | Wiley |
| record_format | wiley_oa |
| spellingShingle | Additional‐Processing‐Free Multiparty Reversible Data Hiding Over Encrypted Domain Bing Chen Ranran Yang Bingwen Feng Xiuye Zhan Jun Cai Concurrency and Computation: Practice and Experience Additional‐Processing‐Free Multiparty Reversible Data Hiding Over Encrypted Domain Bing Chen Ranran Yang Bingwen Feng Xiuye Zhan Jun Cai Concurrency and Computation: Practice and Experience ABSTRACT Multiparty reversible data hiding over encrypted domain (MRDH‐ED) provides a safeguard mechanism that enables the restoration of the original cover even if some of the data hiders are potentially compromised. Existing MRDH‐ED methods are accompanied by additional processing in the cover encryption procedure, which results in high computational consumption. In this paper, an additional‐processing‐free MRDH‐ED method with compatibility is given. The original cover is encrypted into multiple encrypted covers by using a composite‐order secret sharing. Additive operation over the composite‐order finite field is employed to embed secret data into each encrypted cover. Since the original cover can be encrypted without additional processing in the cover encryption procedure, the computational consumption is reduced. And the embedding capacity is improved, regardless of the distribution of the covers. With the help of the composite‐order secret sharing, the proposed method is compatible with other bit‐level covers. The proposed scheme's superiority is demonstrated through the presentation of experimental results. 10.1002/cpe.70708 http://onlinelibrary.wiley.com/termsAndConditions#vor |
| title | Additional‐Processing‐Free Multiparty Reversible Data Hiding Over Encrypted Domain |
| topic | Concurrency and Computation: Practice and Experience |
| url | https://onlinelibrary.wiley.com/doi/10.1002/cpe.70708 |