欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2006, Vol. 23 ›› Issue (6): 827-832.DOI: 10.7523/j.issn.2095-6134.2006.6.017

• 简报 • 上一篇    下一篇

乘性单调张成方案

张志芳   

  1. 中国科学院数学与系统科学研究院,北京,100080. E-mail: zfz@amss.ac.cn
  • 收稿日期:1900-01-01 修回日期:1900-01-01 发布日期:2006-11-15

Multiplicative Monotone Span Programs

ZHANG Zhi-Fang   

  1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, China
  • Received:1900-01-01 Revised:1900-01-01 Published:2006-11-15

摘要:

乘性单调张成方案(或乘性的线性密钥共享体制)是设计安全多方计算协议的一个重要
工具。本文给出了一个单调张成方案(或线性密钥共享体制)具有乘性的充分必要条件,即通过判断
一个线性方程组是否有解可以确定一个单调张成方案是否具有乘性。作为例子,我们研究了Shamir的
门限密钥共享体制以及带权重的门限密钥共享体制,指出了它们具有乘性时所应具备的条件。

关键词: 乘性单调张成方案, 线性密钥共享体制, 安全多方计算

Abstract: Multiplicative monotone span program (or multiplicative linear secret sharing scheme)
is a important tool for building a multi-party computation protocol。In this paper, we give a necessary
and su±cient condition for a monotone span program (or linear secret sharing scheme) to be multiplica-
tive,i.e., we can decide whether a monotone span program is multiplicative by judging if a system of
linear equations is solvable. As examples, we study Shamir’s threshold secret sharing scheme and the
extended threshold scheme with weights, pointing out when they are multiplicative, respectively.

中图分类号: