Two Verifiable Multi-Secret Sharing Schemes: A Linear Scheme with Standard Security and A Lattice-Based Scheme

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Hadian Dehkordi m.; MASHHADI S.; Kiamari N.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2020 | Volume:8 | Issue:3 (31) Page(s): 101-115

Download Full-Text

Persian Verion

View:

385

Download:

Cites:

Information Journal Paper

Title

Two Verifiable Multi-Secret Sharing Schemes: A Linear Scheme with Standard Security and A Lattice-Based Scheme

Author(s)

Hadian Dehkordi m. | MASHHADI S. | Kiamari N. | Issue Writer Certificate

Keywords

Secret SharingQ1

VerifiabilityQ1

Standard SecurityQ1

Post-QuantumQ1

LatticeQ1

LWE ProblemQ1

Abstract

In this paper, we present two verifiable multi-Secret Sharing schemes, including a linear multi-Secret Sharing scheme with public access structure and a threshold (t, n) scheme based on the learning with errors (LWE) problem. The first scheme is a linear multi-Secret Sharing scheme in which a number of secrets is distributed by a dealer among a set of participants according to the access structure corresponding to each secret. This scheme has the advantages of the earlier ones and it also has many practical applications compared to previous schemes including a multi-use verifiable multi-Secret Sharing scheme in which the secret reconstruction is according to the dealer’ s preassigned order. In addition, the security of the scheme has been proven in the standard model. This scheme is based on the hard problems in number theory and therefore is not secure against quantum attacks. The second scheme presented in this paper is a Lattice-based Secret Sharing scheme. In this scheme, which is a threshold (t, n) multi-Secret Sharing scheme, the presence of at least t participants is required for the reconstruction of the secret. The security of this scheme is based on the difficulty of the LWE Problem and so it is resistant against quantum attacks.

Cites

No record.

References

No record.

Cite

APA: Copy

Hadian Dehkordi, m., MASHHADI, S., & Kiamari, N.. (2020). Two Verifiable Multi-Secret Sharing Schemes: A Linear Scheme with Standard Security and A Lattice-Based Scheme. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 8(3 (31) ), 101-115. SID. https://sid.ir/paper/405134/en

Vancouver: Copy

Hadian Dehkordi m., MASHHADI S., Kiamari N.. Two Verifiable Multi-Secret Sharing Schemes: A Linear Scheme with Standard Security and A Lattice-Based Scheme. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2020;8(3 (31) ):101-115. Available from: https://sid.ir/paper/405134/en

IEEE: Copy

m. Hadian Dehkordi, S. MASHHADI, and N. Kiamari, “Two Verifiable Multi-Secret Sharing Schemes: A Linear Scheme with Standard Security and A Lattice-Based Scheme,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 8, no. 3 (31) , pp. 101–115, 2020, [Online]. Available: https://sid.ir/paper/405134/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops