Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Christiansen, Mark M."'
Autor:
Calmon, Flavio du Pin, Médard, Muriel, Varia, Mayank, Duffy, Ken R., Christiansen, Mark M., Zeger, Linda M.
We present information-theoretic definitions and results for analyzing symmetric-key encryption schemes beyond the perfect secrecy regime, i.e. when perfect secrecy is not attained. We adopt two lines of analysis, one based on lossless source coding,
Externí odkaz:
http://arxiv.org/abs/1503.08513
Publikováno v:
EEE Transactions on Information Theory, 61 (12), 6876-6886 (2015)
The Guesswork problem was originally motivated by a desire to quantify computational security for single user systems. Leveraging recent results from its analysis, we extend the remit and utility of the framework to the quantification of the computat
Externí odkaz:
http://arxiv.org/abs/1405.5024
A string is sent over a noisy channel that erases some of its characters. Knowing the statistical properties of the string's source and which characters were erased, a listener that is equipped with an ability to test the veracity of a string, one st
Externí odkaz:
http://arxiv.org/abs/1311.1053
Autor:
Calmon, Flavio du Pin, Varia, Mayank, Médard, Muriel, Christiansen, Mark M., Duffy, Ken R., Tessaro, Stefano
Lower bounds for the average probability of error of estimating a hidden variable X given an observation of a correlated random variable Y, and Fano's inequality in particular, play a central role in information theory. In this paper, we present a lo
Externí odkaz:
http://arxiv.org/abs/1310.1512
Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word via the uniform distribution maximizes the attacker's difficulty, its G
Externí odkaz:
http://arxiv.org/abs/1301.6356
Autor:
Calmon, Flavio du Pin, Médard, Muriel, Zeger, Linda M., Barros, João, Christiansen, Mark M., Duffy, Ken. R.
We present a new information-theoretic definition and associated results, based on list decoding in a source coding setting. We begin by presenting list-source codes, which naturally map a key length (entropy) to list size. We then show that such cod
Externí odkaz:
http://arxiv.org/abs/1210.2126
Autor:
Christiansen, Mark M., Duffy, Ken R.
Publikováno v:
IEEE Transactions on Information Theory, 59 (2), 796-802 2013
How hard is it guess a password? Massey showed that that the Shannon entropy of the distribution from which the password is selected is a lower bound on the expected number of guesses, but one which is not tight in general. In a series of subsequent
Externí odkaz:
http://arxiv.org/abs/1205.4135
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Christiansen, Mark M.
The security of systems is often predicated on a user or application selecting an object, a password or key, from a large list. If an inquisitor wishing to identify the object in order to gain access to a system can only query each possibility, one a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______223::da0743b2032633c0de5e080404be7534
http://eprints.maynoothuniversity.ie/6520/
http://eprints.maynoothuniversity.ie/6520/
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.