A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity

  • Authors:
  • Darko Kirovski

  • Affiliations:
  • Microsoft Research, Redmond, WA

  • Venue:
  • DCC '05 Proceedings of the Data Compression Conference
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction.An additional requirement is that the uniqueness of COA's random structure can be verified using an inexpensive device.Bauder was the first to propose COAs created as a randomized augmentation of a set of fixed-length fibers into a transparent gluing material that randomly fixes once for all the position of the fibers within.Recently, Kirovski showed that linear improvement in the compression ratio of a point-set compression algorithm used to store fibers' location, yields exponential increase in the cost of forging a fiber-based COA instance.To address this issue, in this paper, we introduce a novel, generalized heuristic that compresses M points in an N-dimensional grid with computational complexity proportional to O(M^2 ). We compare its performance with an expected lower bound.The heuristic can be used for numerous other applications such as storage of biometric patterns.