ON THE DESIGN AND SECURITY OF A LATTICE-BASED THRESHOLD SECRET SHARING 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.

AMINI KHORASGANI HAMIDREZA; ASAAD SABA; PILARAM HOSSEIN; EGHLIDOS TARANEH; AREF MOHAMMAD REZA

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

Journal Paper

Paper Information

Journal: THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY Year:2016 | Volume:8 | Issue:1 Page(s): 25-38

Download Full-Text

Persian Verion

View:

747

Download:

204

Cites:

Information Journal Paper

Title

ON THE DESIGN AND SECURITY OF A LATTICE-BASED THRESHOLD SECRET SHARING SCHEME

Author(s)

Keywords

THRESHOLD SECRET SHARING SCHEMEQ2

CLOSEST VECTOR PROBLEMQ2

LATTICE-BASED CRYPTOGRAPHYQ2

Abstract

In this paper, we introduce a method of THRESHOLD SECRET SHARING SCHEME (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channels which requires designing lattice-based TSSSs. We investigate the effect of lattice dimension on the security and correctness of the proposed scheme. Moreover, we prove that for a fixed lattice dimension the proposed scheme is asymptotically correct. We also give a quantitative proof of security from information theoretic viewpoint.

Cites

No record.

References

No record.

Cite

APA: Copy

AMINI KHORASGANI, HAMIDREZA, ASAAD, SABA, PILARAM, HOSSEIN, EGHLIDOS, TARANEH, & AREF, MOHAMMAD REZA. (2016). ON THE DESIGN AND SECURITY OF A LATTICE-BASED THRESHOLD SECRET SHARING SCHEME. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 8(1 ), 25-38. SID. https://sid.ir/paper/241797/en

Vancouver: Copy

AMINI KHORASGANI HAMIDREZA, ASAAD SABA, PILARAM HOSSEIN, EGHLIDOS TARANEH, AREF MOHAMMAD REZA. ON THE DESIGN AND SECURITY OF A LATTICE-BASED THRESHOLD SECRET SHARING SCHEME. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2016;8(1 ):25-38. Available from: https://sid.ir/paper/241797/en

IEEE: Copy

HAMIDREZA AMINI KHORASGANI, SABA ASAAD, HOSSEIN PILARAM, TARANEH EGHLIDOS, and MOHAMMAD REZA AREF, “ON THE DESIGN AND SECURITY OF A LATTICE-BASED THRESHOLD SECRET SHARING SCHEME,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 8, no. 1 , pp. 25–38, 2016, [Online]. Available: https://sid.ir/paper/241797/en

Related Journal Papers