Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
スポンサーリンク
概要
- 論文の詳細を見る
Privacy amplification is a technique to distill a secret key from a random variable by a function so that the distilled key and eavesdroppers random variable are statistically independent. There are three kinds of security criteria for the key distilled by privacy amplification: the normalized divergence criterion, which is also known as the weak security criterion, the variational distance criterion, and the divergence criterion, which is also known as the strong security criterion. As a technique to distill a secret key, it is known that the encoder of a Slepian-Wolf (the source coding with full side-information at the decoder) code can be used as a function for privacy amplification if we employ the weak security criterion. In this paper, we show that the encoder of a Slepian-Wolf code cannot be used as a function for privacy amplification if we employ the criteria other than the weak one.
- （社）電子情報通信学会の論文
- 2010-09-01
著者
-
Watanabe Shun
Tokyo Inst. Technol. Tokyo Jpn
-
Uyematsu Tomohiko
Tokyo Inst. Of Technol. Tokyo Jpn
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Watanabe Shun
Department Of Information Science And Intelligent Systems Tokushima University
-
Matsumoto Ryutaroh
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Watanabe Shun
Department Molecular Cell Signaling Tokyo Metropolitan Institute For Neuroscience
関連論文
- Spawning time and place of the Japanese eel Anguilla japonica in the North Equatorial Current of the western North Pacific Ocean
- Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- An Improved Bound for the Dimension of Subfield Subcodes
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,Information Theory and Its Applications)
- FOREWORD
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- Information-theoretical analysis of index searching : Revised
- Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
- Multiterminal source coding with complementary delivering(HISC2006)
- Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
- Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)
- Electric and ionic environmental circumstances interacting at Hosokura underground mine in northeast Japan (特集:Electromagnetic Technologies for Forecasting and Monitoring Natural Hazards)
- Identification of Specific [^3H]Adenine-Binding Sites in Rat Brain Membranes
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- BMP-Induced Ectopic Bone Formation in Osteopetrotic(op/op)Mice
- 11. Role of adhesion molecules in osteoclast differentia tion in alveolar bone promoted by mechanical stress.
- 4. Mechanism of cartilage resorption in femoral epiphy seal plate of osteoscleroticAioc/oc) mice.
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication
- On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
- Using C_ Curves in the Function Field Sieve
- Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound(Information Theory and Its Applications)
- Linear Codes on Nonsingular Curves are Better than Those on Singular Curves
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- 2. Immunohistochemical study on osteoclast recruitment promoted by mechanical stress.
- A Novel Realization of Threshold Schemes over Binary Field Extensions
- AS-2-3 Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight
- Carcinoma of the Larynx:A Retrospective Investigation of 252 Patients
- Carcinoma of the Sphenoid Sinus:Report of a Case