The Science of Quantitative Information Flow
Edition number: 1st ed. 2020
Publisher: Springer
Date of Publication: 23 September 2020
Number of Volumes: 1 pieces, Book
Normal price:
Publisher's listprice:
EUR 64.19
EUR 64.19
Your price:
24 368 (23 208 HUF + 5% VAT )
discount is: 8% (approx 2 119 HUF off)
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
Click here to subscribe.
Availability:
Estimated delivery time: Currently 3-5 weeks.
Not in stock at Prospero.
Can't you provide more accurate information?
Not in stock at Prospero.
Product details:
ISBN13: | 9783319961293 |
ISBN10: | 3319961292 |
Binding: | Hardback |
No. of pages: | 478 pages |
Size: | 235x155 mm |
Weight: | 922 g |
Language: | English |
Illustrations: | XXVIII, 478 p. Illustrations, black & white |
256 |
Category:
Short description:
<p>This book presents a comprehensive mathematical theory that explains precisely what information flow is, how it can be assessed quantitatively ? so bringing precise meaning to the intuition that certain information leaks are small enough to be tolerated ? and how systems can be constructed that achieve rigorous, quantitative information-flow guarantees in those terms. It addresses the fundamental challenge that functional and practical requirements frequently conflict with the goal of preserving confidentiality, making perfect security unattainable.</p><p>Topics include: a systematic presentation of how unwanted information flow, i.e., "leaks", can be quantified in operationally significant ways and then bounded, both with respect to estimated benefit for an attacking adversary and by comparisons between alternative implementations; a detailed study of capacity, refinement, and Dalenius leakage, supporting robust leakage assessments; a unification of information-theoretic channels and information-leaking sequential programs within the same framework; and a collection of case studies, showing how the theory can be applied to interesting realistic scenarios.</p><p>The text is unified, self-contained and comprehensive, accessible to students and researchers with some knowledge of discrete probability and undergraduate mathematics, and contains exercises to facilitate its use as a course textbook.</p>
Long description:
This book presents a comprehensive mathematical theory that explains precisely what information flow is, how it can be assessed quantitatively ? so bringing precise meaning to the intuition that certain information leaks are small enough to be tolerated ? and how systems can be constructed that achieve rigorous, quantitative information-flow guarantees in those terms. It addresses the fundamental challenge that functional and practical requirements frequently conflict with the goal of preserving confidentiality, making perfect security unattainable.
Topics include: a systematic presentation of how unwanted information flow, i.e., "leaks", can be quantified in operationally significant ways and then bounded, both with respect to estimated benefit for an attacking adversary and by comparisons between alternative implementations; a detailed study of capacity, refinement, and Dalenius leakage, supporting robust leakage assessments; a unification of information-theoretic channels and information-leaking sequential programs within the same framework; and a collection of case studies, showing how the theory can be applied to interesting realistic scenarios.The text is unified, self-contained and comprehensive, accessible to students and researchers with some knowledge of discrete probability and undergraduate mathematics, and contains exercises to facilitate its use as a course textbook.Table of Contents:
Part I, Motivation.- Introduction.- Part II, Secrets and How to Measure Them.- Modeling Secrets.- On g-Vulnerability.- Part III, Channels and Information Leakage.- Channels.- Posterior Vulnerability and Leakage.- Robustness.- Capacity.- Composition of Channels.- Refinement.- The Dalenius Perspective.- Axiomatics.- The Geometry of Hypers, Gains, and Losses.- Part IV, Information Leakage in Sequential Programs.- Quantitative Information Flow in Sequential Computer Programs.- Hidden-Markov Modeling of QIF in Programs.- Program Algebra for QIF.- Iteration and Non-termination.- A Demonic Lattice of Information.- Part V, Applications.- The Crowds Protocol.- Timing Attacks on Blinded and Bucketed Cryptography.- Defense Against Side Channels.- Multi-party Computation: The Three Judges Protocol.- Voting Systems.- Differential Privacy.- Glossary and Index.