作者: Teng Guo , Jian Jiao , Feng Liu , Wen Wang
关键词:
摘要: In this paper, we first follow Ateniese et al.'s work that provides upper bounds of the pixel expansion visual cryptography schemesVCSs for more kinds graph access structures, in which require a subset parties can determine secret if they contain an edge G. The constructive are derived by decomposition technique. Then generalize method comparing optimal VCSs with two different structures.