multiplicative linear secret sharing schemes based on connectivity of graphs
文献类型：会议论文
| 作者 | Liu Mulan ; Xiao Liangliang ; Zhang Zhifang |
| 出版日期 | 2007 |
| 会议名称 | 1st SKLOIS Conference on Information Security and Cryptology |
| 会议日期 | DEC 15-17, |
| 会议地点 | Beijing, PEOPLES R CHINA |
| 关键词 | connectivity of graphs monotone span program multiparty computation multiplicative linear secret sharing scheme |
| 页码 | 3973-3978 |
| 英文摘要 | 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 t |
| 收录类别 | EI,ISTP,SCI |
| 会议主办者 | Chinese Acad Sci, State Key Lab Informat Secur |
| 会议录出版者 | IEEE TRANSACTIONS ON INFORMATION THEORY |
| 会议录出版地 | 445 HOES LANE, PISCATAWAY, NJ 08855 USA |
| 语种 | 英语 |
| ISSN号 | 0018-9448 |
| 源URL | [http://124.16.136.157/handle/311060/10986]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Liu Mulan,Xiao Liangliang,Zhang Zhifang. multiplicative linear secret sharing schemes based on connectivity of graphs[C]. 见:1st SKLOIS Conference on Information Security and Cryptology. Beijing, PEOPLES R CHINA. DEC 15-17,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。