본문 바로가기
  • Home

A Study on Star Graph Encryption using Randomized Masking for Preventing Vertex-Label Exposure and Edge-Weight Growth

  • Journal of Software Forensics
  • Abbr : JSF
  • 2026, 22(3), pp.217~228
  • Publisher : Korea Software Assessment and Valuation Society
  • Research Area : Engineering > Computer Science
  • Received : September 14, 2026
  • Accepted : September 20, 2026
  • Published : September 30, 2026

SeongCheol Yoon 1,  Su-Hyun Kim 1,  YoungJoon Joe 2,  Im-Yeong Lee 1

1순천향대학교
2엘에스웨어

Accredited

ABSTRACT

Graph-based encryption maps plaintext to graph vertices and edges, using their labels and weights as ciphertext. Various schemes have been proposed by Ni et al., Bokhary et al., and Ali et al. Ali et al.’s star graph-based scheme maps characters to distinct prime pairs and uses their products as vertex labels. Edge weights are generated by subtracting position-dependent values from these labels. However, identical characters yield identical labels, and edge-weight bit lengths grow substantially with character position. To address these limitations, this paper proposes a new star graph-based encryption scheme. It randomizes vertex labels using a random nonce and a secret key, then splits them into bounded edge weights and auxiliary labels. This bounds all edge weights and achieves linear ciphertext size for a fixed character set. The scheme also mitigates vertex-label pattern leakage and provides ciphertext integrity.

Journal Copyright Policy

No CCL information provided

Citation status

* References for papers published after 2025 are currently being built.