Abstract
We address problem of computing of a channel, modeled as a nondeterministic transducer. We give three possible statements of notion of covert channel capacity and relate different definitions. We then provide several methods allowing computation of lower and upper bounds for of a channel. We show that, in some cases, including case of input-deterministic channels, of channel can be computed exactly (e.g. in form of the largest root of some polynomial). Resume. Nous proposons l'utilisation des transducteurs nondeterministes pour modelisation des canaux caches. Trois definitions possibles de notion de du canal cache sont proposees, et leurs relations sont etudiees. Nous donnons ensuite plusieurs methodes permettant le calcul des bornes inferieures et superieures pour capacite d'un canal cache. Nous montrons que, dans certains cas, qui incluent le cas des transducteurs deterministes en entree, capacite peut etre calculee exactement (sous forme de la racine plus grande d'un polynome).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
