Add to ORKGThe Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav & Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for iid, Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents formfixed rate source compression on the one hand and exponents for guessing moments on the other hand is established
© 2017 IEEE. We consider an abstraction of computational security in password protected systems wher...
This paper is on developing some computer-assisted proof methods involving non-classical inequalitie...
In this paper, we propose a novel layering approach to achieve end-to-end exponential security witho...
The Shannon cipher system is studied in the context of general sources using a notion of computation...
The Shannon cipher system is studied in the context of general sources using a notion of computation...
The Shannon theory of cipher systems is combined with recent work on guessing values of random varia...
Cataloged from PDF version of article.The Shannon theory of cipher systems is combined with recent ...
Guesswork forms the mathematical framework for quantifying computational security subject to brute-f...
Guesswork forms the mathematical framework for quantifying computational security subject to brute-f...
Guesswork forms the mathematical framework for quantifying computational security subject to brute-...
Ahlswede R. Remarks on Shannon's secrecy systems. Problems of Control and Information Theory. 1982;1...
We introduce a new measure of information-theoretic secrecy based on rate-distortion theory and stud...
The problem of guessing a random string is revisited. A close relation between guessing and compress...
Abstract—Correlated sources are present in communication systems where protocols ensure that there i...
We consider single and multiple attacker scenarios in guessing and obtain bounds on various success ...
© 2017 IEEE. We consider an abstraction of computational security in password protected systems wher...
This paper is on developing some computer-assisted proof methods involving non-classical inequalitie...
In this paper, we propose a novel layering approach to achieve end-to-end exponential security witho...
The Shannon cipher system is studied in the context of general sources using a notion of computation...
The Shannon cipher system is studied in the context of general sources using a notion of computation...
The Shannon theory of cipher systems is combined with recent work on guessing values of random varia...
Cataloged from PDF version of article.The Shannon theory of cipher systems is combined with recent ...
Guesswork forms the mathematical framework for quantifying computational security subject to brute-f...
Guesswork forms the mathematical framework for quantifying computational security subject to brute-f...
Guesswork forms the mathematical framework for quantifying computational security subject to brute-...
Ahlswede R. Remarks on Shannon's secrecy systems. Problems of Control and Information Theory. 1982;1...
We introduce a new measure of information-theoretic secrecy based on rate-distortion theory and stud...
The problem of guessing a random string is revisited. A close relation between guessing and compress...
Abstract—Correlated sources are present in communication systems where protocols ensure that there i...
We consider single and multiple attacker scenarios in guessing and obtain bounds on various success ...
© 2017 IEEE. We consider an abstraction of computational security in password protected systems wher...
This paper is on developing some computer-assisted proof methods involving non-classical inequalitie...
In this paper, we propose a novel layering approach to achieve end-to-end exponential security witho...