Results 211 to 220 of about 13,248 (255)

A (t,n) multi-secret sharing scheme

Applied Mathematics and Computation, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chou Chen Yang, Ting Yi Chang, Min-Shiang Hwang   +2 more
openaire   +2 more sources

Multi-secret visual cryptography with deterministic contrast

Multimedia Tools and Applications, 2013
The multi-secret visual cryptography scheme (MVCS) allows for the encryption of multiple secret images into a given image area. The previous works on MVCS with probabilistic contrast can not guarantee that every original pixel will be reconstructed correctly.
Bin Yu 0003, Gang Shen
openaire   +1 more source

Sharing Multi-Secret Based on Circle Properties

2008 International Conference on Computational Intelligence and Security, 2008
A (t, n) threshold multi-secret sharing scheme based on the properties of a circle in multi-dimensional space is proposed in this paper. Only t or more shadows can reconstruct the secrets; while any less than t shadows cannot obtain any information of the secrets.
Lina Ge, Shaohua Tang
openaire   +1 more source

Multi-secret sharing threshold access structure

2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2015
This paper proposes threshold access structure for multi-secret sharing. It uses a two-level encoding for share generation from multiple secret images. In the first level of encoding secure Boolean based operations are used. The second level of encoding uses Chinese remainder theorem and Lagrange Interpolation. It is mainly useful for secure encryption
L. Siva Reddy, Munaga V. N. K. Prasad
openaire   +1 more source

Efficient collusion resistant multi-secret image sharing

Multimedia Tools and Applications, 2020
Multi-secret image sharing techniques (MSS) extend the secret image sharing schemes. The paper reports a novel MSS scheme designed to be collusion resistant. It starts with a brief introduction of the concept thereafter discussing the related works in the domain. Security is an implicit requirement for MSS techniques.
Kapil Mishra, Sannihith Kavala, Satish Kumar Singh, P. Nagabhushan   +3 more
openaire   +1 more source

Embedding Strategies in Multi-secret Steganography

2017
This paper discusses the different embedding strategies in multi-secret steganography. Each secret is related to one selected embedding procedure, which may depend or not on personal features or characteristics. Such multi-way embedding approach allows to reveal secrets independently of each other.
Katarzyna Koptyra, Marek R. Ogiela
openaire   +1 more source

Visual multi-secret sharing with friendliness

Journal of Shanghai Jiaotong University (Science), 2014
Visual secret sharing (VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing (VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS.
Fuh-gwo Jeng, Kai-siang Lin, Chih-hung Lin, Tzung-her Chen   +3 more
openaire   +1 more source

Key Generation for Multi-Secret Steganography

2015 2nd International Conference on Information Science and Security (ICISS), 2015
This article presents a method of steganographic keys generation for case of embedding many secrets in single container. The most important requirements of proposed algorithm are as follows. The generated keys cannot overlap what means that the positions they indicate in the cover have to be different.
Katarzyna Koptyra, Marek R. Ogiela
openaire   +1 more source

A Novel Color Multi-Secret Visual Cryptography Scheme

Proceedings of the 2020 3rd International Conference on Artificial Intelligence and Pattern Recognition, 2020
In this paper a color multi-secret visual cryptography scheme specifically for (3, 4, 5) access structure is proposed with random colors and XOR operation being leveraged to generate the sharing images. The recovery images with size invariant are obtained by the XOR operation of specific combination of shares.
Rui Sun, Zhengxin Fu, Bin Yu 0003, Hangying Huang   +3 more
openaire   +1 more source

High-Capacity Multi-secret Sharing by Random Grid

2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010
It’s well-known that visual secret sharing aims at encrypting a secret image into numerous meaningless sharing images by either designing a well-designed codebook or generating random bit sequence, and reconstructing the secret by superimposing them without any computation involved.
Tzung-Her Chen, Yao-Sheng Lee, Ci-Lin Li
openaire   +1 more source