Threshold Secret Sharing Requires a Linear Size Alphabet.
Electronic Colloquium on Computational Complexity (ECCC)(2016)
摘要
We prove that for every n and $$1< t < n$$1更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要
Electronic Colloquium on Computational Complexity (ECCC)(2016)