Fetching the paper…
Reading the bibliography…
Consider the problem of guessing the realization of a random vector $\textbf{X}$ by repeatedly submitting queries (guesses) of the form "Is $\textbf{X}$ equal to $\textbf{x}$?" until an affirmative answer is obtained.
J. M. Wozencraft, “Sequential decoding for reliable communication,” Ph.D. dissertation, Research Laboratory of Electronics, Massachusetts Institute of Technology, May 1957
1957
Earlier work this paper cites.
J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE transactions on Information Theory , vol. 24, no. 5, pp. 530–536, September 1978
1978
Earlier work this paper cites.
R. Krichevsky and V. Trofimov, “The performance of universal encoding,” IEEE Transactions on Information Theory , vol. 27, no. 2, pp. 199–207, March 1981
1981
Earlier work this paper cites.
J. Ziv, “Universal decoding for finite-state channels,” IEEE Transactions on Information Theory , vol. IT-31, no. 4, pp. 453–460, July 1985
1985
Earlier work this paper cites.
N. Merhav, “Universal coding with minimum probability of codeword length overflow,” IEEE Transactions on Information Theory , vol. 37, no. 3, pp. 556–563, May 1991
1991
Earlier work this paper cites.
M. Feder, “Gambling using a finite state machine,” IEEE Transactions on Information Theory , vol. 37, no. 5, pp. 1459–1465, September 1991
1991
Earlier work this paper cites.
M. J. Weinberger, J. Ziv, and A. Lempel, “On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences,” IEEE Transactions on Information Theory , vol. 38, no. 2, pp. 380–385, March 1992
1992
Earlier work this paper cites.
M. Feder, N. Merhav, and M. Gutman, “Universal prediction of individual sequences,” IEEE transactions on Information Theory , vol. 38, no. 4, pp. 1258–1270, July 1992
1992
Earlier work this paper cites.
J. L. Massey, “Guessing and entropy,” in Proceedings of IEEE International Symposium on Information Theory , 1994, p. 204
1994
Earlier work this paper cites.
M. Bishop and D. V. Klein, “Improving system security via proactive password checking,” Computers & Security , vol. 14, no. 3, pp. 233–249, 1995
1995
Earlier work this paper cites.
E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Transactions on Information Theory , vol. 42, no. 1, pp. 99–105, January 1996
1996
Earlier work this paper cites.
E. Arikan and N. Merhav, “Guessing subject to distortion,” IEEE Transactions on Information Theory , vol. 44, no. 3, pp. 1041–1056, May 1998
1998
Earlier work this paper cites.
J. O. Pliam, “On the incomparability of entropy and marginal guesswork in brute-force attacks,” in Progress in Cryptology —INDOCRYPT 2000 , B. Roy and E. Okamoto, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 67–79
2000
Earlier work this paper cites.
2000
Earlier work this paper cites.
Y. Ephraim and N. Merhav, “Hidden markov processes,” IEEE Transactions on information theory , vol. 48, no. 6, pp. 1518–1569, June 2002
2002
Earlier work this paper cites.
T. Uyematsu and S. Kuzuoka, “Conditional lempel-ziv complexity and its application to source coding theorem with side information,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , vol. 86, no. 10, pp. 2615–2617, 2003
2003
Earlier work this paper cites.
C. E. Pfister and W. G. Sullivan, “Rényi entropy, guesswork moments, and large deviations,” IEEE Transactions on Information Theory , vol. 50, no. 11, pp. 2794–2800, November 2004
2004
Earlier work this paper cites.
J. Yan, A. Blackwell, R. Anderson, and A. Grant, “Password memorability and security: empirical results,” IEEE Security Privacy , vol. 2, no. 5, pp. 25–31, September 2004
2004
Cited alongside, same era.
D. Malone and W. G. Sullivan, “Guesswork and entropy,” IEEE Transactions on Information Theory , vol. 50, no. 3, pp. 525–526, March 2004
2004
Cited alongside, same era.
R. Sundaresan, “Guessing under source uncertainty with side information,” in 2006 IEEE International Symposium on Information Theory , July 2006, pp. 2438–2440
2006
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of information theory , 2nd ed. New York, NY, USA: John Wiley & Sons, 2006
2006
Cited alongside, same era.
R. Sundaresan, “Guessing under source uncertainty,” IEEE Transactions on Information Theory , vol. 53, no. 1, pp. 269–287, January 2007
2007
M. M. Christiansen, K. R. Duffy, F. du Pin Calmon, and M. Médard, “Guessing a password over a wireless channel (on the effect of noise non-uniformity),” in 2013 Asilomar Conference on Signals, Systems and Computers , November 2013, pp. 51–55
2013
Later among the works it cites.
M. M. Christiansen and K. R. Duffy, “Guesswork, large deviations, and shannon entropy,” IEEE Transactions Information Theory , vol. 59, no. 2, pp. 796–802, February 2013
2013
Later among the works it cites.
A. Juels and R. L. Rivest, “Honeywords: Making password-cracking detectable,” in Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security . ACM, 2013, pp. 145–160
2013
Later among the works it cites.
I. Kontoyiannis and S. Verdú, “Optimal lossless data compression: Non-asymptotics and asymptotics,” IEEE Transactions on Information Theory , vol. 60, no. 2, pp. 777–795, February 2014
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
J. Owens and J. Matthews, “A study of passwords and methods used in brute-force SSH attacks,” in USENIX Workshop on Large-Scale Exploits and Emergent Threats (LEET) , 2008
2008
Cited alongside, same era.
M. Weir, S. Aggarwal, B. d. Medeiros, and B. Glodek, “Password cracking using probabilistic context-free grammars,” in 2009 30th IEEE Symposium on Security and Privacy , May 2009, pp. 391–405
2009
Cited alongside, same era.
M. D. Amico, P. Michiardi, and Y. Roudier, “Password strength: An empirical analysis,” in Proceedings IEEE Infocom , March 2010, pp. 1–9
2010
Cited alongside, same era.
M. K. Hanawal and R. Sundaresan, “Randomised attacks on passwords,” DRDO-IISc Programme on Advanced Research in Mathematical Engineering , 2010
2010
Cited alongside, same era.
W. Szpankowski and S. Verdú, “Minimum expected length of fixed-to-variable lossless compression without prefix constraints,” IEEE Transactions on Information Theory , vol. 57, no. 7, pp. 4017–4025, July 2011
2011
Cited alongside, same era.
S. Komanduri, R. Shay, P. G. Kelley, M. L. Mazurek, L. Bauer, N. Christin, L. F. Cranor, and S. Egelman, “Of passwords and people: Measuring the effect of password-composition policies,” in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems , ser. CHI ’11. New York, NY, USA: ACM, 2011, pp. 2595–2604
2011
Cited alongside, same era.
M. K. Hanawal and R. Sundaresan, “Guessing revisited: A large deviations approach,” IEEE Transactions on Information Theory , vol. 57, no. 1, pp. 70–78, January 2011
2011
Cited alongside, same era.
T. A. Courtade and S. Verdú, “Variable-length lossy compression and channel coding: Non-asymptotic converses via cumulant generating functions,” in 2014 IEEE International Symposium on Information Theory , June 2014, pp. 2499–2503
2014
Later among the works it cites.
D. Vishwakarma and C. E. V. Madhavan, “Efficient dictionary for salted password analysis,” in 2014 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT) , January 2014, pp. 1–6
2014
Later among the works it cites.
M. M. Christiansen, K. R. Duffy, F. du Pin Calmon, and M. Médard, “Multi-user guesswork and brute force security,” IEEE Transactions on Information Theory , vol. 61, no. 12, pp. 6876–6886, December 2015
2015
Later among the works it cites.
A. Beirami, R. Calderbank, K. Duffy, and M. Médard, “Quantifying computational security subject to source constraints, guesswork and inscrutability,” in 2015 IEEE International Symposium on Information Theory (ISIT) , June 2015, pp. 2757–2761
2015
Later among the works it cites.
A. Beirami, R. Calderbank, M. Christiansen, K. Duffy, A. Makhdoumi, and M. Médard, “A geometric perspective on guesswork,” in 2005 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) , September 2015, pp. 941–948
2015
Later among the works it cites.
O. Kosut and L. Sankar, “Asymptotics and non-asymptotics for universal fixed-to-variable source coding,” IEEE Transactions on Information Theory , vol. 63, no. 6, pp. 3757–3772, June 2017
2017
Later among the works it cites.
A. Rezaee, A. Beirami, A. Makhdoumi, M. Médard, and K. Duffy, “Guesswork subject to a total entropy budget,” in 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , October 2017, pp. 1008–1015
2017
Later among the works it cites.
Y. Yona and S. Diggavi, “The effect of bias on the guesswork of hash functions,” in 2017 IEEE International Symposium on Information Theory (ISIT) , June 2017, pp. 2248–2252
2017
Later among the works it cites.
S. Salamatian, A. Beirami, A. Cohen, and M. Médard, “Centralized vs. decentralized multi-agent guesswork,” in Information Theory (ISIT), 2017 IEEE International Symposium on . IEEE, 2017, pp. 2258–2262
2017
Later among the works it cites.
2017
Later among the works it cites.
S. Salamatian, W. Huleihel, A. Beirami, A. Cohen, and M. Médard, “Why botnets work: Distributed brute-force attacks need no synchronization,” in revision, IEEE Transactions on Information Forensics and Security , 2018
2018
Closest in time.
E. Tirado, B. Turpin, C. Beltz, P. Roshon, R. Judge, and K. Gagneja, “A new distributed brute-force password cracking technique,” in International Conference on Future Network Systems and Security . Springer, 2018, pp. 117–127
2018
Closest in time.
D. Wang, H. Cheng, P. Wang, J. Yan, and X. Huang, “A security analysis of honeywords,” https://tinyurl.com/y87ffmny, NDSS, 2018
2018
Closest in time.