Melola Discovery

← Melola Discovery

Open access Journal SINTA 3

SECURING INFORMATION CONFIDENTIALITY: A MATHEMATICAL APPROACH TO DETECTING CHEATING IN ASMUTH-BLOOM SECRET SHARING

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 3 (2025) · pp. 1989–2002

DOI
10.30598/barekengvol19iss3pp1989-2002
ISSN
2615-3017, 1978-7227
Published
2025-07-01
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The Secret Sharing Scheme (SSS) based on the Chinese Remainder Theorem (CRT) is a crucial method for safeguarding confidential information. However, this scheme is vulnerable to collaborative cheating involving multiple participants. This study aims to modify the Asmuth-Bloom scheme by introducing two detection mechanisms: Threshold Range Detection and Detection Parameter Verification, to identify and prevent collaborative fraudulent activities. The research design is based on mathematical algorithms and tests the effectiveness of detection against predetermined cheating scenarios using structured parameters. The results indicate that the proposed modifications can accurately detect the manipulation of secret fragments, even in cases involving participant collusion. This robustness is achieved through the mathematical structure of the CRT, which enables the detection of inconsistencies during the secret reconstruction process. In addition to maintaining the efficiency of the original Asmuth-Bloom scheme, these modifications enhance the reliability of the scheme in protecting sensitive data. The study concludes that the implementation of dual detection mechanisms significantly strengthens the security of the SSS, particularly in applications prone to dishonest participant collaboration. Future research is recommended to explore computational efficiency and the implementation of this scheme in real-world environments, such as financial systems and blockchain technology.

Collaboration network of the authors

14 authors · 21 co-authorship links · 1 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • IPB University
  • Universitas Pamulang
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Dhea EkaputriIPB University2
Sapto Mukti HandoyoIPB University2
Euis ApriantiUniversitas Pamulang1
Bib Paruhum SilalahiIPB University1
Ulil Albab Mu'minIPB University1
Toni BakhtiarIPB University1
Farida HanumIPB University1
Afdhal AhkrizalIPB University1
E. H. NUGRAHANIIPB University1
Endar Hasafah NugrahaniIPB University1
Trianty Putri BlanteIPB University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 15 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SECURING INFORMATION CONFIDENTIALITY: A MATHEMATICAL APPROACH TO DETECTING CHEATING IN ASMUTH-BLOOM SECRET SHARING</dc:title>
	<dc:creator>Darmawan, Azhar Janjang</dc:creator>
	<dc:creator>Guritman, Sugi</dc:creator>
	<dc:creator>Jaharuddin, Jaharuddin</dc:creator>
	<dc:description xml:lang="en-US">The Secret Sharing Scheme (SSS) based on the Chinese Remainder Theorem (CRT) is a crucial method for safeguarding confidential information. However, this scheme is vulnerable to collaborative cheating involving multiple participants. This study aims to modify the Asmuth-Bloom scheme by introducing two detection mechanisms: Threshold Range Detection and Detection Parameter Verification, to identify and prevent collaborative fraudulent activities. The research design is based on mathematical algorithms and tests the effectiveness of detection against predetermined cheating scenarios using structured parameters. The results indicate that the proposed modifications can accurately detect the manipulation of secret fragments, even in cases involving participant collusion. This robustness is achieved through the mathematical structure of the CRT, which enables the detection of inconsistencies during the secret reconstruction process. In addition to maintaining the efficiency of the original Asmuth-Bloom scheme, these modifications enhance the reliability of the scheme in protecting sensitive data. The study concludes that the implementation of dual detection mechanisms significantly strengthens the security of the SSS, particularly in applications prone to dishonest participant collaboration. Future research is recommended to explore computational efficiency and the implementation of this scheme in real-world environments, such as financial systems and blockchain technology.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-07-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17382</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss3pp1989-2002</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 3 (2025): BAREKENG: Journal of Mathematics and Its Application; 1989-2002</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss3year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17382/10842</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Azhar Janjang Darmawan, Sugi Guritman, Jaharuddin Jaharuddin</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>