Two secret sharing schemes based on Boolean operations

Wang, Daoshun; Zhang, Lei; Ma, Ning; Li, Xiaobo

doi:10.1016/j.patcog.2006.11.018

Cited by 231 publications

(100 citation statements)

References 21 publications

Supporting

Mentioning

100

Contrasting

Order By: Relevance

“…A secret sharing scheme can be evaluated based on a number of properties, including its security, reconstruction precision, computation complexity and storage requirement [21]. This section presents an analysis and discussion of the QRCSS scheme based on these properties.…”

Section: Analysis and Discussionmentioning

confidence: 99%

“…The secret can only be reconstructed when information from an authorized number of shares is combined [2]. By splitting and encoding a secret into a number of shares, secret sharing overcomes the problem of storing a secret in a single information-carrier, which can easily be lost or damaged [19,21]. Secret sharing schemes are important tools that have found many applications in cryptography and distributed computing [2].…”

Section: Introductionmentioning

confidence: 99%

“…Even complete knowledge of any k−1, or fewer, shares will reveal no information about the secret. Since its inception, many different secret sharing schemes have been proposed [1,2,8,7,16,17,[19][20][21][22]25]. Some schemes require complex numerical computation, whilst others require little or no computation [21].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing

Chow

Susilo

Yang

et al. 2016

Information Security and Privacy

View full text Add to dashboard Cite

This paper investigates a novel approach to secret sharing using QR codes. The proposed QR code secret sharing approach exploits the error correction mechanism inherent in the QR code structure, to distribute and encode information about a secret message in a number of shares. Each share in the scheme is constructed from a cover QR code, and each share itself is a valid QR code which can be scanned and decoded by a QR code reader. The secret message can be recovered by combining the information contained in the QR code shares. Since each share is a valid QR code, the proposed scheme has the advantage of reducing the likelihood of attracting the attention of potential attackers. In addition, the shares can be distributed via public channels without raising suspicion. Moreover, shares do not have to be stored or transmitted electronically, as QR codes can be distributed via printed media. Abstract. This paper investigates a novel approach to secret sharing using QR codes. The proposed QR code secret sharing approach exploits the error correction mechanism inherent in the QR code structure, to distribute and encode information about a secret message in a number of shares. Each share in the scheme is constructed from a cover QR code, and each share itself is a valid QR code which can be scanned and decoded by a QR code reader. The secret message can be recovered by combining the information contained in the QR code shares. Since each share is a valid QR code, the proposed scheme has the advantage of reducing the likelihood of attracting the attention of potential attackers. In addition, the shares can be distributed via public channels without raising suspicion. Moreover, shares do not have to be stored or transmitted electronically, as QR codes can be distributed via printed media. Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing

show abstract

Section: Analysis and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing

Chow

Susilo

Yang

et al. 2016

Information Security and Privacy

View full text Add to dashboard Cite

show abstract

“…This model constructs an efficient (k, k)-VCS based on "XOR". A number of XOR-based VCSs were proposed in [15], [16]. The share images of these schemes are still meaningless.…”

Section: Introductionmentioning

confidence: 99%

K out of K Extended Visual Cryptography Scheme Based on “XOR”

Dang¹,

He²,

Wang³

et al. 2015

IJCCE

Self Cite

View full text Add to dashboard Cite

Visual cryptography schemes (VCS) is an encryption technique that utilizes human visual system in recovering secret image and it does not require any complex calculation. Many VCSs without pixel expansion have been proposed. But they recover secret image with low contrast due to the stacking operation. To improve the quality of recovered image, XOR-based VCS has been proposed. However, shares constructed from XOR-based VCS are random-looking. It suffers a management problem which dealers cannot visually identify each share. In this paper, we propose an (k, k) extended visual cryptography scheme (EVCS) by "XOR" operation to solve above mentioned problem. This is implemented by diving the share image into two parts using a parameter and operating the secret pixels and cover pixels respectively. Comparing with previous schemes, the qualities of share images and recovered image are improved, and our scheme also suit the "OR" operation.

show abstract

“…These types of secret sharing schemes are known as traditional non-visual Secret Sharing (SS). Another type of a secret sharing scheme is Visual Secret Sharing (VSS) [9][10][11][12][13][14][15], which was first designed in 1995 by N o a r and S h a m i r [9], based on the (k, n)-threshold concept. In VSS scheme, out of n, any k or more shares can reconstruct the original image "visually" by superimposing the shares and it does not involve any complex computations.…”

Section: Introductionmentioning

confidence: 99%