Fetching the paper…
Reading the bibliography…
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle.
N. Meteopolis and S. Ulam, Journal of the American Statistical Association, 44
1949
Earlier work this paper cites.
M. N. Wegman and J. L. Carter, Journal of Computer and System Sciences, 18
1979
Earlier work this paper cites.
C. H. Bennett and G. Brassard, in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing (IEEE Press, New York, 1984) pp. 175–179
1984
Earlier work this paper cites.
B. Chor and O. Goldreich, in Foundations of Computer Science, 1985., 26th Annual Symposium on (IEEE, 1985) pp. 429–442
1985
Earlier work this paper cites.
R. Impagliazzo, L. A. Levin, and M. Luby, in Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC ’89 (ACM, New York, NY, USA, 1989) pp. 12–24, ISBN 0-89791-307-8
1989
Earlier work this paper cites.
D. Zuckerman, in Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on (IEEE, 1990) pp. 534–543
1990
Earlier work this paper cites.
N. Nisan and A. Wigderson, J. Comput. Syst. Sci., 49
1994
Earlier work this paper cites.
H. Krawczyk, in Advances in Cryptology - CRYPTO’94, Lecture Notes in Computer Science , Vol. 893 (Springer-Verlag, 1994) pp. 129–139
1994
Earlier work this paper cites.
B. Schneier and P. Sutherland, Applied cryptography: protocols, algorithms, and source code in C (John Wiley & Sons, Inc. New York, NY, USA, 1995)
1995
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Cre¡äpeau, and U. M. Mauer, IEEE Trans. Inf. Theory, 41
1995
Earlier work this paper cites.
L. Trevisan, Journal of the ACM, 48
1999
Earlier work this paper cites.
R. Raz, O. Reingold, and S. Vadhan, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (1999) pp. 149–158
1999
Cited alongside, same era.
T. Jennewein, U. Achleitner, G. Weihs, H. Weinfurter, and A. Zeilinger, Review of Scientific Instruments, 71
2000
Cited alongside, same era.
R. Canetti, Universally composable security: A new paradigm for cryptographic protocols , Tech. Rep. TR01-016 (Electronic Colloquium on Computational Complexity (ECCC), 2001) preliminary version in IEEE Symposium on Foundations of Computer Science, p. 136-145, 2001
2001
Cited alongside, same era.
R. Raz, O. Reingold, and S. Vadhan, Journal of Computer and System Sciences, 65
2002
Cited alongside, same era.
Y. Mansour, N. Nisan, and P. Tiwari, Theoretical Computer Science, 107
2002
Cited alongside, same era.
A. Uchida et al. , Nature Photonics, 2
2008
Later among the works it cites.
I. Reidler, Y. Aviad, M. Rosenbluh, and I. Kanter, Physical review letters, 103
2009
Later among the works it cites.
2009
Later among the works it cites.
B. Qi, Y.-M. Chi, H.-K. Lo, and L. Qian, Opt. Lett., 35
2010
Later among the works it cites.
M. A. Wayne and P. G. Kwiat, Opt. Express, 18
2010
Later among the works it cites.
C. Gabriel, C. Wittmann, D. Sych, R. Dong, W. Mauerer, U. Andersen, C. Marquardt, and G. Leuchs, Nature Photonics, 4
2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Canetti and H. Krawczyk, in EUROCRYPT 2002, Lecture Notes in Computer Science , Vol. 2332 (Springer-Verlag, 2002) pp. 337–351
2002
Cited alongside, same era.
M. Epstein, L. Hars, R. Krasinski, M. Rosner, and H. Zheng, Cryptographic Hardware and Embedded Systems-CHES 2003, 152 (2003)
2003
Cited alongside, same era.
T. Hartman and R. Raz, Random Structures & Algorithms, 23
2003
Cited alongside, same era.
M. Ben-Or, M. Horodecki, D. W. Leung, D. Mayers, and J. Oppenheim, in Second Theory of Cryptography Conference TCC 2005, Lecture Notes in Computer Science , Vol. 3378 (Springer-Verlag, 2005) pp. 386–406
2005
Cited alongside, same era.
R. Renner and R. König, in Second Theory of Cryptography Conference TCC 2005, Lecture Notes in Computer Science , Vol. 3378 (Springer-Verlag, 2005) pp. 407–425
2005
Cited alongside, same era.
P. L’Ecuyer and R. Simard, ACM Transactions on Mathematical Software (TOMS), 33
2007
Cited alongside, same era.
X. Ma, Z. Zhang, and X. Tan, Arxiv preprint arXiv:1109.6147 (2011a)
Cited in the paper.
Later among the works it cites.
C.-H. F. Fung, X. Ma, and H. F. Chau, Phys. Rev. A, 81
2010
Later among the works it cites.
T. Asai and T. Tsurumaru, IEICE technical report, ISEC2010-121 (2011), in Japanese
2011
Later among the works it cites.
F. Xu, B. Qi, X. Ma, H. Xu, H. Zheng, and H.-K. Lo, Opt. Express, 20
2012
Closest in time.