More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
Masahito Hayashi, Toyohiro Tsurumaru
Centre for Quantum Technologies National University of Singapore Nagoya University Mitsubishi Electric (Japan)
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
We explicitly construct random hash functions for privacy amplification (extractors) that require smaller random seed lengths than the previous literature, and still allow efficient implementations with complexity O(n log n) for input length n. The key idea is the concept of dual universal2hash function introduced recently. We also use a new method for constructing extractors by concatenating δ-almost dual universal2hash functions with other extractors. Besides minimizing seed lengths, we also introduce methods that allow one to use non-uniform random seeds for extractors. These methods can be applied to a wide class of extractors, including dual universal2hash function, as well as to the conventional universal2hash functions.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AICryptography and Data Security
Coding theory and cryptography · Quantum Information and Cryptography