首页> 外文期刊>Designs, Codes and Crytography >A Representation of a Family of Secret Sharing Matroids
【24h】

A Representation of a Family of Secret Sharing Matroids

机译:秘密共享类人机器人家族的代表

获取原文
获取原文并翻译 | 示例
           

摘要

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid M with N uniform components secret sharing? When N -1, M corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing
机译:确定拟人机器人是否进行秘密共享是一个众所周知的公开问题。在Ng和Walker中表明,拟阵在强连通性下分解为均匀的拟阵。然后问题变成如下:具有N个统一成分的拟阵M何时秘密共享?当N -1时,M对应于一个均匀的拟阵,因此是秘密共享。在本文中,我们通过使用射影几何构造表示,证明具有两个统一成分的所有相连拟阵都是秘密共享

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号