Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 1096463, 11 pages
Research Article

A Low-Complexity Region-Based Authentication Algorithm for 3D Polygonal Models

1Department of M-Commerce and Multimedia Applications, Asia University, Taichung, Taiwan
2Department of Medical Research, China Medical University Hospital, China Medical University, Taichung, Taiwan
3Institute of Nuclear Energy Research, Taoyuan, Taiwan
4Department of Information Technology and Management, Shih Chien University, Taipei, Taiwan

Correspondence should be addressed to Yao-Hsien Huang; moc.liamg@gnauh.oobad

Received 27 July 2016; Revised 20 October 2016; Accepted 9 November 2016; Published 12 January 2017

Academic Editor: Ángel Martín Del Rey

Copyright © 2017 Yuan-Yu Tsai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This study proposes a low-complexity region-based authentication algorithm for three-dimensional (3D) polygonal models, based on local geometrical property evaluation. A vertex traversal scheme with a secret key is adopted to classify each vertex into one of two categories: embeddable vertices and reference vertices. An embeddable vertex is one with an authentication code embedded. The algorithm then uses reference vertices to calculate local geometrical properties for the corresponding embeddable vertices. For each embeddable vertex, we feed the number of reference vertices and local properties into a hash function to generate the authentication code. The embeddable vertex is then embedded with the authentication code, which is based on a simple message-digit substitution scheme. The proposed algorithm is of low complexity and distortion-controllable and possesses a higher and more adaptive embedding capacity and a higher embedding rate than most existing region-based authentication algorithms for 3D polygonal models. The experimental results demonstrate the feasibility of the proposed algorithm.