公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 |
---|---|---|---|---|---|---|
2014 | Statistically-secure ORAM with Õ (log² n) Overhead | Kai-Min Chung; Zhenming Liu; Rafael Pass | ||||
2012 | The Knowledge Tightness of Parallel Zero-Knowledge | Kai-Min Chung; Rafael Pass; Wei-Lung Dustin Tseng | ||||
2011 | The Randomness Complexity of Parallel Repetition | Kai-Min Chung; Rafael Pass | ||||
2008 | Tight Bounds for Hashing Block Sources | Kai-Min Chung; Salil Vadhan | ||||
2015 | Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence | Kai-Min Chung; Rafael Pass | ||||
2013 | Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream | Kai-Min Chung; Michael Mitzenmacher; Salil P. Vadhan | Theory of computing 9, 897-945 |