lp_solve version 5.5.
http://lpsolve.sourceforge.net/.
Mário S. Alvim, Konstantinos Chatzikokolakis, Catuscia Palamidessi & Geoffrey Smith (2012):
Measuring Information Leakage Using Generalized Gain Functions.
In: Proc. of CSF.
IEEE,
pp. 265–279,
doi:10.1109/CSF.2012.26.
Miguel Andres, E., Catuscia Palamidessi, Ana Sokolova & Peter Van Rossum (2011):
Information Hiding in Probabilistic Concurrent Systems.
Theor. Comp. Sci. 412(28),
pp. 3072–3089,
doi:10.1016/j.tcs.2011.02.045.
Gilles Barthe & Boris Köpf (2011):
Information-theoretic Bounds for Differentially Private Mechanisms.
In: Proc. of CSF.
IEEE,
pp. 191–204,
doi:10.1109/CSF.2011.20.
Fabrizio Biondi, Axel Legay, Pasquale Malacaria & Andrzej Wasowski (2013):
Quantifying Information Leakage of Randomized Protocols.
In: Proc. of VMCAI,
pp. 68–87,
doi:10.1007/978-3-642-35873-9_7.
Michele Boreale (2009):
Quantifying information leakage in process calculi.
Inf. Comput. 207(6),
pp. 699–725,
doi:10.1016/j.ic.2008.12.007.
Michele Boreale, Francesca Pampaloni & Michela Paolini (2011):
Asymptotic Information Leakage under One-Try Attacks.
In: Proc. of FOSSACS,
pp. 396–410,
doi:10.1007/978-3-642-19805-2_27.
Christelle Braun, Konstantinos Chatzikokolakis & Catuscia Palamidessi (2009):
Quantitative Notions of Leakage for One-try Attacks.
In: Proc. of MFPS,
ENTCS 249.
Elsevier,
pp. 75–91,
doi:10.1016/j.entcs.2009.07.085.
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira & Roberto Segala (2008):
Analyzing Security Protocols Using Time-Bounded Task-PIOAs.
Discrete Event Dynamic Systems 18,
pp. 111–159,
doi:10.1007/s10626-007-0032-1.
Konstantinos Chatzikokolakis & Catuscia Palamidessi (2007):
Making random choices invisible to the scheduler.
In: Proc. of CONCUR'07.
Springer,
pp. 42–58,
doi:10.1016/j.ic.2009.06.006.
Konstantinos Chatzikokolakis, Catuscia Palamidessi & Prakash Panangaden (2008):
Anonymity Protocols as Noisy Channels.
Inf. Comput. 206(2–4),
pp. 378–401,
doi:10.1016/j.ic.2007.07.003.
David Chaum (1981):
Untraceable electronic mail, return addresses, and digital pseudonyms.
Commun. ACM 24(2),
pp. 84–90,
doi:10.1145/358549.358563.
Tom Chothia, Yusuke Kawamoto & Chris Novakovic (2013):
A Tool for Estimating Information Leakage.
In: Proc. of CAV'13,
doi:10.1007/978-3-642-39799-8_47.
Tom Chothia, Yusuke Kawamoto & Chris Novakovic (2014):
LeakWatch: Estimating Information Leakage from Java Programs.
In: Proc. of ESORICS'14,
pp. 219–236,
doi:10.1007/978-3-319-11212-1_13.
Tom Chothia, Yusuke Kawamoto, Chris Novakovic & David Parker (2013):
Probabilistic Point-to-Point Information Leakage.
In: Proc. of CSF.
IEEE,
pp. 193–205,
doi:10.1109/CSF.2013.20.
David Clark, Sebastian Hunt & Pasquale Malacaria (2001):
Quantitative Analysis of the Leakage of Confidential Data.
In: Proc. of QAPL'01,
ENTCS 59 (3).
Elsevier,
pp. 238–251,
doi:10.1016/S1571-0661(04)00290-7.
Barbara Espinoza & Geoffrey Smith (2011):
Min-Entropy Leakage of Channels in Cascade.
In: Proc. of FAST,
LNCS 7140.
Springer,
pp. 70–84,
doi:10.1007/978-3-642-29420-4_5.
Barbara Espinoza & Geoffrey Smith (2013):
Min-entropy as a resource.
Inf. Comput.,
doi:10.1016/j.ic.2013.03.005.
Yusuke Kawamoto, Konstantinos Chatzikokolakis & Catuscia Palamidessi (2014):
Compositionality Results for Quantitative Information Flow.
In: Proc. of QEST'14,
pp. 368–383,
doi:10.1007/978-3-319-10696-0_28.
Yusuke Kawamoto & Thomas Given-Wilson (2015):
Quantitative Information Flow for Scheduler-Dependent Systems.
Research Report.
INRIA.
Available at http://hal.inria.fr/hal-01114778.
Paul C Kocher (1996):
Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems.
In: Proc. of CRYPTO'96.
Springer,
pp. 104–113,
doi:10.1007/3-540-68697-5_9.
Boris Köpf & David A. Basin (2007):
An information-theoretic model for adaptive side-channel attacks.
In: Proc. of CCS.
ACM,
pp. 286–296,
doi:10.1145/1315245.1315282.
Annabelle McIver, Carroll Morgan, Geoffrey Smith, Barbara Espinoza & Larissa Meinicke (2014):
Abstract Channels and Their Robust Information-Leakage Ordering.
In: Proc. of POST'14,
pp. 83–102,
doi:10.1007/978-3-642-54792-8_5.
Geoffrey Smith (2009):
On the Foundations of Quantitative Information Flow.
In: Proc. of FOSSACS,
LNCS 5504.
Springer,
pp. 288–302,
doi:10.1007/978-3-642-00596-1_21.
Geoffrey Smith (2011):
Quantifying Information Flow Using Min-Entropy.
In: Proc. of QEST'11,
pp. 159–167,
doi:10.1109/QEST.2011.31.
Lijun Zhang & Martin R. Neuhäußer (2010):
Model Checking Interactive Markov Chains.
In: Proc. of TACAS'10.
Springer-Verlag,
Berlin, Heidelberg,
pp. 53–68,
doi:10.1007/978-3-642-12002-2_5.
eptcs@eptcs.org