Elements of information theory
Elements of information theory
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Guesswork and Variation Distance as Measures of Cipher Security
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Encrypted Key Exchange: Password-Based Protocols SecureAgainst Dictionary Attacks
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Ciphers and their products: group theory in private key cryptography
Ciphers and their products: group theory in private key cryptography
Compositional closure for Bayes Risk in probabilistic noninterference
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Leakage quantification of cryptographic operations
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Quantitative information flow and applications to differential privacy
Foundations of security analysis and design VI
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Linguistic properties of multi-word passphrases
FC'12 Proceedings of the 16th international conference on Financial Cryptography and Data Security
Effect of grammar on security of long passwords
Proceedings of the third ACM conference on Data and application security and privacy
Optimizing password composition policies
Proceedings of the fourteenth ACM conference on Electronic commerce
Hi-index | 0.00 |
We discuss measures of statistical uncertainty relevant to determining random values in cryptology. It is shown that unbalanced and self-similar Huffman trees have extremal properties with respect to these measures. Their corresponding probability distributions exhibit an unbounded gap between (Shannon) entropy and the logarithm of the minimum search space size necessary to be guaranteed a certain chance of success (called marginal guesswork). Thus, there can be no general inequality between them. We discuss the implications of this result in terms of the security of weak secrets against brute-force searching attacks, and also in terms of Shannon's uncertainty axioms.