Secret Data Fusion Based on Chinese Remainder Theorem

In some high-level secure applications in need of multiple participants input their own secret data to achieve access control, such as, secure cabinet opened by multiple owners together, traditional security technology is not applicable. Although secret sharing may be used in the scenarios, there are some problems when directly applying primary secret sharing methods including visual cryptography (VC) and polynomial-based secret sharing. In this paper, we first describe the application scenario (namely secret data fusion) and its requirements, where secret data fusion is different from secret sharing. Then, we propose a possible method for secret data fusion based on Chinese remainder theorem (CRT). Theoretical analyses and experiments are examined to represent the effectiveness of our method.