Results 191 to 200 of about 899 (216)

An ideal multi-secret sharing scheme based on MSP

Information Sciences, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chingfang Hsu, Bing Zeng
exaly   +3 more sources

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures

Lecture Notes in Computer Science, 2011
This paper is a survey of the main results and open problems in a line of work that was initiated shortly after secret sharing was introduced. Namely, the construction of ideal linear secret sharing schemes for access structures that are natural generalizations of the threshold ones and have interesting properties for the applications.
Oriol Farras, Carles Padró, Farras Oriol   +2 more
exaly   +2 more sources

Ideal uniform multipartite secret sharing schemes

Information Sciences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojun Ren, Li Hu, Yongzhi Cao
exaly   +2 more sources

On the Composition of Matroids and Ideal Secret Sharing Schemes

Designs, Codes and Cryptography, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Siaw-Lynn Ng, Michael Walker 0001
openaire   +2 more sources

Ideal Secret Sharing Schemes with Share Selectability

2011
In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret.
Keita Emura, Atsuko Miyaji, Akito Nomura, Mohammad Shahriar Rahman, Masakazu Soshi   +4 more
openaire   +1 more source

Ideal Perfect Multilevel Threshold Secret Sharing Scheme

2009 Fifth International Conference on Information Assurance and Security, 2009
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate and y-coordinate of a polynomial as private share. In our second modification, dealer uses polynomial
Changlu Lin, Lein Harn, Dingfeng Ye
openaire   +1 more source

An Ideal Multi-secret Sharing Scheme Based on Connectivity of Graphs

Wireless Personal Communications, 2013
Secure communication has become more and more important for many modern communication applications. In a secure communication, every pair of users need to have a secure communication channel (each channel is controlled by a server) In this paper, using monotone span programs we devise an ideal linear multi-secret sharing scheme based on connectivity of
Ching-Fang Hsu 0001, Lein Harn, Guohua Cui   +2 more
openaire   +1 more source

A Novel Ideal Contrast Visual Secret Sharing Scheme with Reversing

Journal of Multimedia, 2009
In visual secret sharing (VSS) schemes, a secret image can be visually revealed from overlapping shadow images without additional computations. However, the contrast of reconstructed image is much lost. Employing reversing operation to reverse black and white pixels as well as increasing encoding runs is an effective way to improve the contrast.
Haibo Zhang, Xiaofei Wang, Youpeng Huang
openaire   +1 more source

(2, n) Secret Image Sharing Scheme with Ideal Contrast

2010 International Conference on Computational Intelligence and Security, 2010
In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image.
Lin Dong, Daoshun Wang, Min Ku, Yiqi Dai
openaire   +1 more source

A Novel Encoding Method for Ideal Contrast Visual Secret Sharing Schemes with Reversing

2008 International Conference on Computer Science and Software Engineering, 2008
In visual secret sharing (VSS) schemes, a secret image can be visually revealed by overlapping shares. But the contrast of reconstructed image is much lost. A useful way to improve this situation is to employ reversing, a non-cryptographic operation supported by most copy machines, to reverse black and white pixels.
Haibo Zhang, Xiaofei Wang, Youpeng Huang
openaire   +1 more source