Multiplicative linear secret sharing schemes based on connectivity of graphs
文献类型：期刊论文
| 作者 | Liu, Mulan; Xiao, Liangliang; Zhang, Zhifang |
| 刊名 | IEEE TRANSACTIONS ON INFORMATION THEORY
 |
| 出版日期 | 2007-11-01 |
| 卷号 | 53期号:11页码:3973-3978 |
| 关键词 | connectivity of graphs monotone span program multiparty computation multiplicative linear secret sharing scheme |
| ISSN号 | 0018-9448 |
| DOI | 10.1109/TIT.2007.907505 |
| 英文摘要 | The multiplicative property is important for a linear secret sharing scheme (LSSS) to be used in constructing a multiparty computation (MPC) protocol. In general, an LSSS has to expand its share size to obtain the multiplicative property. In this paper, with respect to an MPC problem based on connectivity of graphs we devise an ideal multiplicative LSSS, that is, the LSSS is of the multiplicative property without expanding its share size. Moreover, it provides a new class of access structures that have ideal multiplicative LSSSs. |
| WOS研究方向 | Computer Science ; Engineering |
| 语种 | 英语 |
| WOS记录号 | WOS:000250448800009 |
| 出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/4225]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Liu, Mulan |
| 作者单位 | 1.Chinese Acad Sci, Key Lab Math Mech, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Liu, Mulan,Xiao, Liangliang,Zhang, Zhifang. Multiplicative linear secret sharing schemes based on connectivity of graphs[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2007,53(11):3973-3978. |
| APA | Liu, Mulan,Xiao, Liangliang,&Zhang, Zhifang.(2007).Multiplicative linear secret sharing schemes based on connectivity of graphs.IEEE TRANSACTIONS ON INFORMATION THEORY,53(11),3973-3978. |
| MLA | Liu, Mulan,et al."Multiplicative linear secret sharing schemes based on connectivity of graphs".IEEE TRANSACTIONS ON INFORMATION THEORY 53.11(2007):3973-3978. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。