| 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 |
| 页码 | 3973-3978 |
| 会议日期 | DEC 15-17, |
| 会议地点 | Beijing, PEOPLES R CHINA |
| 收录类别 | ei,istp,sci |
| 出版地 | 445 HOES LANE, PISCATAWAY, NJ 08855 USA |
| 出版者 | IEEE TRANSACTIONS ON INFORMATION THEORY |
| ISSN | 0018-9448 |
| 部门归属 | Chinese Acad Sci, Key Lab Math Mech, Acad Math & Syst Sci, Beijing 100080, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. |
| 摘要 | 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 |
| 关键词 | Connectivity Of Graphs Monotone Span Program Multiparty Computation Multiplicative Linear Secret Sharing Scheme |
| 主办者 | Chinese Acad Sci, State Key Lab Informat Secur |
| 语种 | 英语 |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/10986 |
| 专题 | 中国科学院软件研究所 |
| 推荐引用方式 GB/T 7714 | Liu Mulan,Xiao Liangliang,Zhang Zhifang. multiplicative linear secret sharing schemes based on connectivity of graphs[C]. 445 HOES LANE, PISCATAWAY, NJ 08855 USA:IEEE TRANSACTIONS ON INFORMATION THEORY,2007:3973-3978. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| 04373416.pdf（186KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论