MO2.R9.2

A Perfect Ideal Hierarchical Secret Sharing Scheme Based on The CRT for Polynomial Rings

Jing Yang, Shu-Tao Xia, Tsinghua University, China; Xianfang Wang, CETC Cyberspace Security Technology Co.,Ltd., China; Jiangtao Yuan, University of Electronic Science and Technology of China, China; Fang-Wei Fu, Nankai University, China
Session:
Secret Key Schemes
Track:
14: Secure Communication and Computation
Location:
Lamda
Presentation Time:
Mon, 8 Jul, 12:10 - 12:30
Session Chair:
Cheuk Ting Li, The Chinese University of Hong Kong
Presentation
Not logged in.
Discussion
Not logged in.
Session MO2.R9
MO2.R9.1: Variable-Length Secret Key Agreement via Random Stopping Time
Junda Zhou, Cheuk Ting Li, The Chinese University of Hong Kong, Hong Kong SAR of China
MO2.R9.2: A Perfect Ideal Hierarchical Secret Sharing Scheme Based on The CRT for Polynomial Rings
Jing Yang, Shu-Tao Xia, Tsinghua University, China; Xianfang Wang, CETC Cyberspace Security Technology Co.,Ltd., China; Jiangtao Yuan, University of Electronic Science and Technology of China, China; Fang-Wei Fu, Nankai University, China
MO2.R9.3: Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness Generation
Prashanth Kumar Herooru Sheshagiri, Juan Alberto Cabrera, Frank H. P. Fitzek, Technische Universität Dresden, Germany
Resources
No resources available.