Efficient, XOR-Based, Ideal $$(t,n)-$$threshold Schemes

Chen, Liqun; Laing, Thalia M.; Martin, Keith M.

doi:10.1007/978-3-319-48965-0_28

Cited by 12 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More specifically, we measure performance that shows the latter is more efficient in distribution if n, or p, is not large, where k ≥ 3. Here, several approaches [13], [14], [15], [16] to discussing the connection to Shamir's scheme have been reported, but no discussion has been provided on the connection between XOR-based secret sharing schemes and the properties of circulant matrices. Recent researches [17], [18] also proposed XOR-based related approaches.…”

Section: Our Contributionsmentioning

confidence: 99%

New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (k, n) Threshold Secret Sharing Schemes

Shima

Doi

2021

Journal of Information Processing

View full text Add to dashboard Cite

Several secret sharing schemes with low computational costs have been proposed. XOR-based secret sharing schemes have been reported to be a part of such low-cost schemes. However, no discussion has been provided on the connection between them and the properties of circulant matrices. In this paper, we propose several theorems of circulant matrices to discuss the rank of a matrix and then show that we can discuss XOR-based secret sharing schemes using the properties of circulant matrices. We also present an evaluation of our software implementation.

show abstract

Section: Our Contributionsmentioning

confidence: 99%

New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (k, n) Threshold Secret Sharing Schemes

Shima

Doi

2021

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…Thus, in case of authority revocation, 1 4 of the data needs to be re-encrypted, which reduces the computation overhead. 7) IDA-XOR 2016 [31]: This variant is based on "error code correction". It is a lightweight IDA, without using general RS codes, combining the generation of random bits with the systematic IDA.…”

Section: B Rabin Information Dispersal Algorithm Ida [20]mentioning

confidence: 99%

Preserving data security in distributed fog computing

et al. 2019

View full text Add to dashboard Cite

In this paper, a novel cryptographic solution is proposed to secure data in fog computing. The solution combines the AES-GMAC operation mode with information dispersal over GF(2 w) to provide data confidentiality, integrity, and availability along with source authentication. The value of w is flexible (8, 16, 32 or 64) and it could be configured according to the fog device features. Moreover, the proposed cryptographic solution is based on the dynamic key-dependent approach, which allows for a good compromise between the security level and computational complexity. In the proposed solution, the collected data at one fog node is encrypted, authenticated and dispersed in a pseudorandom manner to its n neighbor fog nodes. For data recovery, any k of the n fragments along with the corresponding dynamic key are required to retrieve the original data. This complicates the attacker's task who needs to compromise at least k fog nodes to disclose the encrypted data. Additionally, attackers should seek the dynamic key, which is different for each input data. On the other hand, redundant fragments protect the stored data against up to (n − k) fog nodes' failure or unavailability. The security and performance analysis tests show that the proposed security scheme exhibits a high level of efficiency and robustness.

show abstract

“…The scheme features polynomials within a finite field and restores keys between polynomials via Lagrangian interpolation. Other secret sharing techniques feature different polynomials, or the use of various mathematical principles such as Exclusive-OR (XOR) [ 12 , 13 , 14 ], Chinese remainder theorem (CRT) [ 15 , 16 ], or hash functions [ 17 , 18 ].…”

Section: Related Workmentioning

confidence: 99%

Dynamic Group Authentication and Key Exchange Scheme Based on Threshold Secret Sharing for IoT Smart Metering Environments

Lee

2018

Sensors

View full text Add to dashboard Cite

The Internet of Things (IoT) environment is constantly evolving. Many IoT services have emerged, improving living conditions. Smart homes were among the first developments, and smart buildings, smart factories, and smart cities are attracting increasing attention. Smart cities represent the ultimate convergence of the IoT, the Cloud, big data, and mobile technology. Smart homes, buildings, and factories create smart cities. In addition, the IoT finds applications in traffic control, public safety, and medical services, permitting group-based communication. As the scale of service grows, the number of things (devices) constituting the service also increases. However, security vulnerabilities arise in group-based communication environments. A device may require authentication when entering a gateway; to secure environments with large numbers of devices (such as those featuring IoT smart metering), the gateways bear heavy loads. Therefore, efficient authentication of group leaders and devices is essential. Here, we develop a dynamic group authentication and key exchange scheme for group-based IoT smart metering environments which enables efficient communication among secure IoT services. Our group authentication scheme increases the computational efficiency of the group leader and the participating devices, based on a threshold secret sharing technique.

show abstract

Efficient, XOR-Based, Ideal $$(t,n)-$$threshold Schemes

Cited by 12 publications

References 15 publications

New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (<i>k</i>, <i>n</i>) Threshold Secret Sharing Schemes

New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (<i>k</i>, <i>n</i>) Threshold Secret Sharing Schemes

Preserving data security in distributed fog computing

Dynamic Group Authentication and Key Exchange Scheme Based on Threshold Secret Sharing for IoT Smart Metering Environments

Contact Info

Product

Resources

About