Abstract
In this paper, we investigate the problems of uniform random number generation, independent uniform random number generation, and secret key agreement, which provide the information theoretic security. We consider the strong uniformity and strong independence, where it has been unclear whether or not sparse matrices can be applied to these problems for general (correlated) sources with respect to these criteria. To prove the theorems, we first introduce the notion of the balanced-coloring property and the collision-resistance property. We next apply these properties to the problems. Since an ensemble of sparse matrices (with logarithmic column weight) over a finite field satisfies these properties, we can construct a code achieving the fundamental limits by using sparse matrices.
This paper is based on Proc. 2012 IEEE Inform. Theory Workshop, Lausanne, Switzerland, Sep. 3–7, 2012, pp. 612–616.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
E. Abbe, Polarization and randomness extraction, in Proceedings of 2011 IEEE International Symposium Information Theory (St. Petersburg, Russia, 31 July–5 Aug 2011), pp. 184–188
R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography — Part I: secret sharing. IEEE Trans. Inform. Theory IT–39(4), 1121–1132 (1993)
R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography — Part II: CR capacity. IEEE Trans. Inform. Theory IT–44(1), 225–240 (1998)
C.H. Bennett, G. Brassard, C. Crepeau, U. Maurer, Generalized privacy amplification. IEEE Trans. Inform. Theory IT–41(6), 1915–1923 (1995)
M. Bloch, Channel intrinsic randomness, in Proceedings of 2010 IEEE International Symposium Information Theory (Austin, USA, 13–18 June 2010), pp. 2607–2611
M. Bloch, J.N. Laneman, Strong secrecy from channel resolvability. IEEE Trans. Inform Theory IT–59(12), 8077–8098 (2013)
C. Cachin, U.M. Maurer, Linking information reconciliation and privacy amplification. J. Cryptol. 10, 97–110 (1997)
T.M. Cover, A proof of the data compression theorem of Slepian and Wolf for ergodic sources. IEEE Trans. Inform. Theory IT–21(2), 226–228 (1975)
T.M. Cover, J.A. Thomas, Elements of Information Theory, 2nd edn. (Wiley, Hoboken, 2006)
I. Csiszár, Linear codes for sources and source networks: error exponents, universal coding. IEEE Trans. Inform. Theory IT–28(4), 585–592 (1982)
I. Csiszár, Almost independence and secrecy capacity. Probl. Inform. Transm. 32(1), 40–47 (1996)
I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. (Cambridge University Press, Cambridge, 2011)
J.L. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci. 18, 143–154 (1979)
T.S. Han, S. Verdú, Apploximation theory of output statistics. IEEE Trans. Inform. Theory IT–39(3), 752–772 (1993)
T.S. Han, Information-Spectrum Methods in Information Theory (Springer, Berlin, 2003)
R. Impagliazzo, D. Zuckerman, How to recycle random bits, in 30th IEEE Symposium of Fundations of Computer Science (30 Oct–1 Nov 1989), pp. 248–253
H. Koga, Coding theorem on the threshold scheme for a general source. IEEE Trans. Inform. Theory IT–52(4), 2658–2677 (2008)
U.M. Maurer, Secret key agreement by public discussion from common information. IEEE Trans. Inform. Theory IT–39(3), 733–742 (1993)
J. Muramatsu, Secret key agreement from correlated source outputs using low density parity check matrices. IEICE Trans. Fundam. E89–A(7), 2036–2046 (2006)
J. Muramatsu, Channel coding and lossy source coding using a generator of constrained random numbers. IEEE Trans. Inform. Theory IT–60(5), 2667–2686 (2014)
J. Muramatsu, Variable-length lossy source cod using a constrained-random-number generator. IEEE Trans. Inform. Theory IT–61(6), 3574–3592 (2014)
J. Muramatsu, T. Koga, T. Mukouchi, On the problem of generating mutually independent random sequences. IEICE Trans. Fundam. E86–A(5), 1275–1284 (2003)
J. Muramatsu, S. Miyake, Hash property and coding theorems for sparse matrices and maximal-likelihood coding. IEEE Trans. Inform. Theory IT–56(5), 2143–2167 (2010). Corrections: IT-56(9), 4762 (2010); IT-59(10), 6952–6953 (2013)
J. Muramatsu, S. Miyake, Construction of Slepian-Wolf source code and broadcast channel code based on hash property (2010), arXiv:1006.5271 [CS.IT]
J. Muramatsu, S. Miyake, Construction of strongly secure wiretap channel code based on hash property, in Proceedings 2011 IEEE International Symposium on Information Theory (St. Petersburg, Russia, 31 July–5 Aug 2011), pp. 612–616
J. Muramatsu, S. Miyake, Construction of codes for wiretap channel and secret key agreement from correlated source outputs based on hash property. IEEE Trans. Inform. Theory IT–58(2), 671–692 (2012)
J. Muramatsu, S. Miyake, Uniform random number generation by using sparse matrix, Proceedings of IEEE Information Theory Workshop (Lausanne, Switzerland, 3–7 Sept 2012), pp. 612–616
J. Muramatsu, S. Miyake, Construction of a channel code from an arbitrary source code with decoder side information, in Proceedings of International Symposium Information Theory and Its Applications (Monterey, CA, USA, 30 Oct–2 Nov, 2016), pp. 176–180
R. Renner, S. Wolf, Simple and tight bounds for information reconciliation and privacy amplification. Lect. Notes Comput. Sci. 3788, 199–216 (2005)
S. Vembu, S. Verdú, Generating random bits from an arbitrary source. IEEE Trans. Inform. Theory IT–41(5), 1322–1332 (1995)
Z. Zhang, Estimating mutual information via Kolmogorov distance. IEEE Trans. Inform. Theory IT–53(9), 3280–3283 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix 1: Proof of Lemmas 1.1 and 1.2
In the following proofs, we use the following lemma.
Lemma 6.5
([31]) Let p and q be probability distributions on the same set \(\mathscr {U}\). Then
where \(H(\mu )\equiv \sum _u \mu (u)\log (1/\mu (u))\) and \(h(\theta )\equiv -\theta \log \theta -[1-\theta ]\log (1-\theta )\).
First, we prove Lemma 1.1. From the fact that \(H(p_{\overline{M}_n})=\log |\mathscr {M}_n|\), we have
where the inequality comes from Lemma 6.5.\(\qquad \square \)
Next, we prove Lemma 1.2. The inequality (5) is shown immediately from (1) and Lemma 1.1. From Lemma 6.5, we have
where the second inequality comes from (1). Furthermore, from Lemma 6.5, we have
where the second inequality comes from the convexity of h. Then we have (6) as
where the second inequality comes from (40) and (41).\(\qquad \square \)
Appendix 2: Proof of Lemma 6.1
When \(\mu _{X^n|Z^n}(\underline{\mathscr {T}}_{X|Z}(\mathbf {z})|\mathbf {z})\ne 0\), we have
where the first inequality comes from Lemma 2.2 and the second inequality comes from the definition of \(\underline{\mathscr {T}}_{X|Z}(\mathbf {z})\) and the fact that \(\mu _{X^n|Z^n}(\underline{\mathscr {T}}_{X|Z}(\mathbf {z})|\mathbf {z})\le 1\). Then we have
which concludes the lemma.\(\qquad \square \)
Appendix 3: Proof of Lemma 6.2
If \(g_B(B\mathbf {x}|\mathbf {y})\ne \mathbf {x}\), there is \(\mathbf {x}'\in \mathscr {C}_B(B\mathbf {x})\) such that \(\mathbf {x}'\ne \mathbf {x}\) and
where the second inequality comes from the definition of \(\overline{\mathscr {T}}_{X|Y}\). This implies that \([\overline{\mathscr {T}}_{X|Y}(\mathbf {y})\setminus \{\mathbf {x}\}]\cap \mathscr {C}_B(B\mathbf {x})\ne \emptyset \). Then we have
where the second inequality comes from Lemma 2.3 and the fact that \(|\overline{\mathscr {T}}_{X|Y}(\mathbf {y})|\le 2^{n[\overline{H}(\mathbf {X}|\mathbf {Y})+\zeta ]}\). We have
which concludes the lemma.\(\qquad \square \)
Appendix 4: Proof of Lemma 6.4
Let \(\underline{\mathscr {T}}'\) and \(\underline{\mathscr {T}}'(\mathbf {z})\) be defined as:
Since \(\varphi _n(\mathbf {x})\in \varphi _n([\underline{\mathscr {T}}'(\mathbf {z})]^c)\) and \(\mathbf {x}\in \varphi _n^{-1}(\varphi _n(\mathbf {x}))\) for all \(\mathbf {x}\in [\underline{\mathscr {T}}'(\mathbf {z})]^c\), we have
On the other hand, we have
where the last inequality comes from the fact that \(|\mathscr {M}_n|=2^{nR}\) and \(|[\underline{\mathscr {T}}'(\mathbf {z})]^c|\le 2^{n[R-\zeta ]}\). From (48) and (49), we have
Then we have the fact that
and
by letting \(n\rightarrow \infty \). From the definition of \(\underline{H}(\mathbf {X}|\mathbf {Z})\), we have
which concludes the lemma by letting \(\zeta \rightarrow 0\).\(\qquad \square \)
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Muramatsu, J., Miyake, S. (2018). Uniform Random Number Generation and Secret Key Agreement for General Sources by Using Sparse Matrices. In: Takagi, T., Wakayama, M., Tanaka, K., Kunihiro, N., Kimoto, K., Duong, D. (eds) Mathematical Modelling for Next-Generation Cryptography. Mathematics for Industry, vol 29. Springer, Singapore. https://doi.org/10.1007/978-981-10-5065-7_10
Download citation
DOI: https://doi.org/10.1007/978-981-10-5065-7_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-5064-0
Online ISBN: 978-981-10-5065-7
eBook Packages: EngineeringEngineering (R0)