作者: Shyong Jian Shyu , Ming Chiang Chen
DOI: 10.1109/TIFS.2011.2158096
关键词: Discrete mathematics 、 Pixel 、 Homomorphic secret sharing 、 Minification 、 Mathematics 、 Secure multi-party computation 、 Integer programming 、 Linear programming 、 Integer (computer science) 、 Secret sharing
摘要: The optimal pixel expansion of an (n, n) visual cryptographic scheme (VCS) was proven as 2n-1 in 1995; and that a (2, n)-VCS proposed 2002. Yet, most existing best expansions (k, n)-VCSs for k ≥ 3 have not been improved since 1996. Whether they are already optimal, if how to find the optimums never explored. In this paper, we model minimization into integer linear program acquire optimum solution. Computational results demonstrate our is simple, effective obtain solution flexible coping with various types n)-VCSs.