Institutional Repository
| multiplicative linear secret sharing schemes based on connectivity of graphs | |
| Liu Mulan; Xiao Liangliang; Zhang Zhifang | |
| 2007 | |
| Conference Name | 1st SKLOIS Conference on Information Security and Cryptology |
| Pages | 3973-3978 |
| Conference Date | DEC 15-17, |
| Conference Place | Beijing, PEOPLES R CHINA |
| Indexed Type | ei,istp,sci |
| Publish Place | 445 HOES LANE, PISCATAWAY, NJ 08855 USA |
| Publisher | IEEE TRANSACTIONS ON INFORMATION THEORY |
| ISSN | 0018-9448 |
| Department | 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. |
| English Abstract | 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 |
| Keyword | Connectivity Of Graphs Monotone Span Program Multiparty Computation Multiplicative Linear Secret Sharing Scheme |
| Sponsorship | Chinese Acad Sci, State Key Lab Informat Secur |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10986 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 04373416.pdf（186KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment