Text Secret Sharing Scheme Based on Shamir Polynomials

With the rapid development of information technology, the security of text documents processed through networks has become a significant concern in people's daily lives and work. This paper proposes a text secret sharing scheme with a specific secret distribution method. The main idea of the algorithm is to first convert the secret information in the txt file into corresponding ASCII codes, then use a Shamir-based polynomial secret sharing scheme to obtain sub-secret information. Simultaneously, a special random distribution method is used to store the sub-secret information in the corresponding txt files for distribution. When restoring, specific shares of sub-secret information are required for extracting specific character information at certain positions. Through Lagrange interpolation operations and character conversion, the original secret information can be obtained. Experimental results demonstrate that this text secret sharing scheme ensures the security of secret information storage and transmission.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/ceccc62598.2024.11063639
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Text Secret Sharing Scheme Based on Shamir Polynomials

Zichen Li, Haiyang Ding, Yinong Song
Cryptography and Data Security
article

Text Secret Sharing Scheme Based on Shamir Polynomials

Zichen Li, Haiyang Ding, Yinong Song
article en

Abstract

With the rapid development of information technology, the security of text documents processed through networks has become a significant concern in people's daily lives and work. This paper proposes a text secret sharing scheme with a specific secret distribution method. The main idea of the algorithm is to first convert the secret information in the txt file into corresponding ASCII codes, then use a Shamir-based polynomial secret sharing scheme to obtain sub-secret information. Simultaneously, a special random distribution method is used to store the sub-secret information in the corresponding txt files for distribution. When restoring, specific shares of sub-secret information are required for extracting specific character information at certain positions. Through Lagrange interpolation operations and character conversion, the original secret information can be obtained. Experimental results demonstrate that this text secret sharing scheme ensures the security of secret information storage and transmission.

Beijing Institute of Graphic Communication (CN)
National Natural Science Foundation of China, Beijing Municipal Commission of Education, Beijing Institute of Graphic Communication
Openalex Percentile: Top 72%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Text Secret Sharing Scheme Based on Shamir Polynomials — Zichen Li, Haiyang Ding, et al. · (2024) | TGRS Research Map | TGRS