左のテーブル Abstract and I. Introduction (抽象とI.紹介) 2.システムモデル セキュア・プライベート・ソース・コーディング・リージョン 4. Gaussian Sources and Channels (ガウシアのソースとチャンネル) V. Theorem 1の証拠 認定と参照 V. 理論の証明 1 A. Theorem 1 の実現性証明 We leverage the output statistics of random binning (OSRB) method [16], [43], [44] for the achievability proof by following the steps described in [45, Section 1.6]. We leverage the output statistics of random binning (OSRB) method [16], [43], [44] for the achievability proof by following the steps described in [45, Section 1.6]. 証拠スケッチ: (58) and (60) result in a communication (storage) rate(通信(ストレージ)レート) Communication Rate: プライベートキーKは均一に分布し、ソースとチャネルのランダム変数に独立しているため、次の仮想シナリオを考慮して漏洩を計算できます。 Privacy Leakage Rate: 次に、プライベート キーの上記の属性を考慮し、および 1 回のパッディング ステップ(52)を考慮すると、仮想 シナリオで計算された漏洩から H(K) = nR0 を引くことができ、元の問題の漏洩を得るため、これが (59) と (60) の合計から生じるので、  → 0 が n → ∞ の場合です。 B. Converse Proof for Theorem 1 私達は得る Privacy Leakage Rate: n(Rl + δn) われわれは Secrecy Leakage Rate: We use the support lemma [48, Lemma 15.4] for the cardinality bound proofs, which is a standard step, so we omit the proof. 我々は、標準的なステップであるカーディナリティ結束証拠のために、サポート lemma [48, Lemma 15.4] を使用します。 Cardinality Bounds: 認知度 O. Gunlu および R. F. Schaefer は、ドイツ連邦教育研究省(BMBF)による Grant 16KIS1004 による部分的な支援を受けました。H. Boche は、Grant 16KISQ037K による 6G コミュニケーション システムに関する国営イニシアチブを通じて、Grant 16KISK002 による 6G-life 研究ハブおよび Post Quantum Crypto の情報理論に関する国営イニシアチブ「Quantum Token Theory and Applications - QTOK」の下で、Grant 16KISQ037K によって、ドイツの Excellence Strategy EXC-2092 CASA-390781972 でドイツ研究財団 (DFG) から追加の資金調達を受けました。 参照 [1] D. Slepian and J. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, July 1973. [2] A. El Gamal and Y.-H. Kim, Network Information Theory. ケンブリッジ, UK: Cambridge University Press, 2011. [3] A. Orlitsky and J. R. Roche, “Coding for computing,” IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903–917, March 2001. [4] O. Gunlu, “Function computing under privacy, secrecy, distortion, and communication constraints,” Entropy, vol. 24, no. 1, June 2022. [5] V. Prabhakaran and K. Ramchandran, “On secure distributed source coding,” in Proc. IEEE Inf. Theory Workshop, Tahoe City, CA, 2007年9月、442-447ページ。 [6] D. Gunduz, E. Erkip, and H. V. Poor, “Secure lossless compression with side information,” in Proc. IEEE Inf. Theory Workshop, Porto, Portugal, May 2008, pp. 169–173. [7] R. Tandon, S. Ulukus, and K. Ramchandran, “Secure source coding with a helper,” IEEE Trans. Inf. Theory, vol. 59, no. 4, pp. 2178-2187, April 2013. [8] D. Gunduz, E. Erkip, and H. V. Poor, “Lossless compression with security constraints,” in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, July 2008, pp. 111–115. [9] W. Luh and D. Kundur, “Distributed secret sharing for discrete memoryless networks,” IEEE Trans. Inf. Forensics Security, vol. 3, no. 3, pp. 1-7, 2008年9月。 [10] K. Kittichokechai, Y.-K. Chia, T. J. Oechtering, M. Skoglund, and T. Weissman, “Secure source coding with a public helper,” IEEE Trans. Inf. Theory, vol. 62, no. 7, pp. 3930–3949, July 2016. [11] S. Salimi, M. Salmasizadeh, and M. R. Aref, “Generalized Secure Distributed Source Coding with Side Information,” IET Commun., Vol. 4, No. 18, pp. 2262–2272, December 2010. [12] F. Naghibi, S. Salimi, and M. Skoglund, “The CEO problem with secrecy constraints,” IEEE Trans. Inf. Forensics Security, vol. 10, no. 6, pp. 1234–1249, June 2015. [13] H. Yamamoto, “Coding theorems for Shannon’s encryption system with correlated source outputs, and common information,” IEEE Trans. Inf. Theory, vol. 40, no. 1, p. 85–95, January 1994. [14] H. Ghourchian, P. A. Stavrou, T. J. Oechtering, and M. Skoglund, “Secure source coding with side-information at decoder and shared key at encoder and decoder,” in Proc. IEEE Inf. Theory Workshop, Kanazawa, Japan, October 2021, pp. 1–6. セキュアなソースコーディングとサイド情報は、デコダードとデコダードで共有されます。 [15] U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 2733–2742, May 1993. [16] R. Ahlswede and I. Csisz ́ar, “Common randomness in information theory and cryptography – Part I: Secret sharing,” IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121–1132, July 1993. 17 A. C. Yao, “Protocols for secure computations,” in Proc. IEEE Symp. Foundations Comp. Sci., Chicago, IL, November 1982, pp. 160–164. [18] — —, “How to generate and exchange secrets,” in Proc. IEEE Symp. Foundations Comp. Sci., Toronto, ON, Canada, October 1986, pp. 162-167。 [19] M. Bloch et al., “An Overview of Information-theoretic Security and Privacy: Metrics, Limits and Applications,” IEEE J. Sel. Areas Inf. Theory, Vol. 2, No. 1, pp. 5-22, Mar. 2021. [20] O. Gunlu and G. Kramer, “Privacy, secrecy, and storage with multiple noisy measurements of identifiers,” IEEE Trans. Inf. Forensics Security, vol. 13, no. 11, pp. 2872–2883, November 2018. [21] O. Gunlu, M. Bloch, and R. F. Schaefer, “Secure multi-function computing with private remote sources,” Sep. 2021, [Online]. Available: arxiv.org/abs/2106.09485. [22] T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971. [23] H. Permuter and T. Weissman, “Source coding with a side information “Vending Machine”, IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4530–4544, July 2011. [24] T. Berger, Z. Zhang, and H. Viswanathan, “The CEO problem,” IEEE Trans. Inf. Theory, vol. 42, no. 3, pp. 887–902, May 1996. [25] O. Gunlu, “Key agreement with physical unclonable functions and biometric identifiers,” Ph.D. dissertation, TU Munich, Germany, November 2018, published by Dr.-Hut Verlag in February 2019. [26] T. Ignatenko and F. M. J. Willems, “Biometric Systems: Privacy and secrecy aspects,” IEEE Trans. Inf. Forensics Security, Vol. 4, No. 4, pp. 956–973, Dec. 2009. [27] L. Lai, S.-W. Ho, and H. V. Poor, “Privacy-security trade-offs in biometric security systems – Part I: Single use case,” IEEE Trans. Inf. Forensics Security, vol. 6, No. 1, pp. 122–139, March 2011. [28] L. Kusters, O. G ̈unl ̈u, and F. M. Willems, “Zero secrety leakage for multiple enrollments of physical unclonable functions,” in Proc. Symp. Inf. Theory Sign. Process. Benelux, Twente, Netherlands, May-June 2018, pp. 119–127. [29] L. Lai, S. W. Ho, and H. V. Poor, “Privacy-security trade-offs in biometric security systems – Part II: Multiple use case,” IEEE Trans. Inf. Forensics Security, Vol. 6, No. 1, pp. 140–151, Mar. 2011. [30] O. Gunlu, “Multi-entity and multi-enrollment key agreement with correlated noise,” IEEE Trans. Inf. Forensics Security, vol. 16, pp. 1190–1202, 2021. [31] W. Tu and L. Lai, “On function computing with privacy and secrecy constraints,” IEEE Trans. Inf. Theory, vol. 65, no. 10, pp. 6716–6733, October 2019. [32] J. Villard and P. Piantanida, “Secure multiterminal source coding with side information at the eavesdropper,” IEEE Trans. Inf. Theory, vol. 59, no. 6, pp. 3668–3692, June 2013. [33] S. I. Bross, “Secure cooperative source-coding with side information at the eavesdropper,” IEEE Trans. Inf. Theory, vol. 62, no. 8, pp. 4544–4558, August 2016. [34] E. Ekrem and S. Ulukus, “Secure lossy source coding with side information,” in Proc. Allerton Conf. Commun., Control, Comput., Monticello, IL, Sep. 2011, pp. 1098–1105. [35] J. Korner and K. Marton, “Comparison of two noisy channels,” Topics Inf. Theory, p. 411–423, August 1977. [36] P. Bergmans, “A simple converse for broadcast channels with additive white Gaussian noise (Corresp.),” IEEE Trans. Inf. Theory, vol. 20, no. 2, pp. 279-280, March 1974. [37] O. Gunlu, R. F. Schaefer, and H. V. Poor, “Biometric and physical identifiers with correlated noise for controllable private authentication,” July 2020, [Online]. Available: arxiv.org/abs/2001.00847. [38] A. D. Wyner and J. Ziv, “A Theorem on the Entropy of Certain Binary Sequences and Applications: Part I,” IEEE Trans. Inf. Theory, Vol. 19, No. 6, pp. 769–772, November 1973. [39] S. Watanabe and Y. Oohama, “Secret key agreement from correlated Gaussian sources by rate limited public communication,” IEICE Trans. Fundam. Electron., Commun. Comp. Sci., vol. 93, no. 11, pp. 1976-1983, November 2010. [40] F. M. Willems and T. Ignatenko, “Quantification effects in biometric systems,” in Proc. Inf. Theory Appl. Workshop, La Jolla, CA, 2009年2月、372-379ページ。 [41] V. Yachongka, H. Yagi, and Y. Oohama, “Secret key-based authentication with passive eavesdropper for scalar Gaussian sources,” February 2022, [Online]. Available: arxiv.org/abs/2202.10018. [42] T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Hoboken, NJ: John Wiley & Sons, 2012. [43] M. H. Yassaee, M. R. Aref, and A. Gohari, “Achievability proof via output statistics of random binning,” IEEE Trans. Inf. Theory, vol. 60, no. 11, pp. 6760-6786, November 2014. [44] J. M. Renes and R. Renner, “Noisy channel coding via privacy amplification and information reconciliation,” IEEE Trans. Inf. Theory, vol. 57, no. 11, pp. 7377–7385, November 2011. [45] M. Bloch, Lecture Notes in Information-Theoretic Security. Atlanta, GA: Georgia Inst. Technol., 2018年7月。 [46] T. Holenstein and R. Renner, “On the randomness of independent experiments,” IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1865–1871, April 2011. [47] M. Bloch and J. Barros, Physical-layer Security. ケンブリッジ、イギリス:ケンブリッジ大学プレス, 2011. [48] I. Csisz ́ar and J. K ̈orner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. Cambridge, UK: Cambridge University Press, 2011. 
 
 
 
 
 
 著者: (1) コミュニケーションエンジニアリングとセキュリティ会長、シェーゲン大学および情報コーディング部門、電気工学部、リンコピング大学のOnur Gunlu(onur.guenlue@uni-siegen.de) (2)ラファエル・F・シェファー、通信工学とセキュリティ部長、シェーゲン大学(rafael.schaefer@uni-siegen.de) (3) ミュンヘン工科大学理論情報技術会長ホルガー・ボーチェ(CASA:Cyber Security in the Age of Large-Scale Adversaries Exzellenzcluster, Ruhr-Universitat Bochum, and BMBF Research Hub 6G-Life, Technical University of Munich) (4) H. Vincent Poor、プリンストン大学電気・コンピュータ工学部(poor@princeton.edu) Authors: (1) コミュニケーションエンジニアリングとセキュリティ会長、シェーゲン大学および情報コーディング部門、電気工学部、リンコピング大学のOnur Gunlu(onur.guenlue@uni-siegen.de) (2)ラファエル・F・シェファー、通信工学とセキュリティ部長、シェーゲン大学(rafael.schaefer@uni-siegen.de) (3) ミュンヘン工科大学理論情報技術会長ホルガー・ボーチェ(CASA:Cyber Security in the Age of Large-Scale Adversaries Exzellenzcluster, Ruhr-Universitat Bochum, and BMBF Research Hub 6G-Life, Technical University of Munich) (4) H. Vincent Poor、プリンストン大学電気・コンピュータ工学部(poor@princeton.edu) 
 
 この論文は CC BY 4.0 DEED ライセンスの下で archiv で利用できます。 この論文は CC BY 4.0 DEED ライセンスの下で archiv で利用できます。 ARCHIV で利用可能

Part of HackerNoon's growing list of open-source research papers, promoting free access to academic material.

EScholar Technologies

EScholar

このオーディオは、ストーリーの元の言語で制作されています。

長すぎる; 読むには

Boost your HackerNoon story @ $159.99! 🚀

「One-Time Padding Still Matters in Modern Cryptography」

About Author

コメント

ラベル

この記事は

Related Stories

18 種類の開発者ツールで生産性を向上しましょう 🚀🔥

暗号通貨の成長: 効果的なユーザーペルソナの作成

HackerNoon ライティングコンテストで優勝したいですか? #crypto-api コンテスト優勝者のおすすめはこちら

ワークフローを10倍に向上させる方法: 必須アプリ17選

18 種類の開発者ツールで生産性を向上しましょう 🚀🔥

暗号通貨の成長: 効果的なユーザーペルソナの作成

HackerNoon ライティングコンテストで優勝したいですか? #crypto-api コンテスト優勝者のおすすめはこちら

ワークフローを10倍に向上させる方法: 必須アプリ17選

Light-Mode

Classic

Newspaper

Dark-Mode

Neon Noir

Minty

HN StartUps