The Art of Modelling Computational Systems

485 Pages·020.665 MB·English

by  Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia

Mário S. Alvim · Kostas Chatzikokolakis ·
Carlos Olarte · Frank Valencia (Eds.)
t
f
i
r
h
c
s
t The Art of Modelling
s
e
F
Computational Systems
0
6
7
1 A Journey from Logic
1

S and Concurrency to Security
C
N and Privacy
L
Essays Dedicated to Catuscia Palamidessi
on the Occasion of Her 60th Birthday
Lecture Notes in Computer Science 11760
Founding Editors
Gerhard Goos
Karlsruhe Institute of Technology, Karlsruhe, Germany
Juris Hartmanis
Cornell University, Ithaca, NY, USA
Editorial Board Members
Elisa Bertino
Purdue University, West Lafayette, IN, USA
Wen Gao
Peking University, Beijing, China
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Gerhard Woeginger
RWTH Aachen, Aachen, Germany
Moti Yung
Columbia University, New York, NY, USA
More information about this series at http://www.springer.com/series/7407
á
M rio S. Alvim Kostas Chatzikokolakis
(cid:129) (cid:129)
Carlos Olarte Frank Valencia (Eds.)
(cid:129)
The Art of Modelling
Computational Systems
A Journey from Logic
and Concurrency to Security
and Privacy
Essays Dedicated to Catuscia Palamidessi
on the Occasion of Her 60th Birthday
123
Editors
Mário S.Alvim KostasChatzikokolakis
Universidade FederaldeMinas Gerais University of Athens
BeloHorizonte, Brazil Athens, Greece
Carlos Olarte FrankValencia
Federal University of RioGrande CNRS& University Javeriana Cali
doNorte- UFRN Palaiseau, France
Natal, Brazil
ISSN 0302-9743 ISSN 1611-3349 (electronic)
Lecture Notesin Computer Science
ISBN 978-3-030-31174-2 ISBN978-3-030-31175-9 (eBook)
https://doi.org/10.1007/978-3-030-31175-9
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©SpringerNatureSwitzerlandAG2019
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow
knownorhereafterdeveloped.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare
believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors
give a warranty, expressed or implied, with respect to the material contained herein or for any errors or
omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin
publishedmapsandinstitutionalaffiliations.
Coverillustration:ByNadiaMiller
ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG
Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland

Preface
This Festschrift has been written in honor of Catuscia Palamidessi on the occasion of
her 60th birthday. It features six laudations and 25 papers by close collaborators and
friendsofhers.ThesecontributionsareatributetoCatuscia’sintellectualdepth,vision,
passion for science, and tenacity in solving technical problems. They also reflect the
breadth and impact of her work.
WehaveknownCatusciafordecades.Wehavehadthehonortoworkcloselywith
her, giving us the opportunity to witness firsthand her amazing intellectual brilliance,
dedication, and perseverance, exhibited in both her scientific work and her personal
life. Besides her professional success, Catuscia is known for her kindness, for her
dispositiontoimprovethecommunitiessheisapartof,andforreliablybeingreadyto
always support colleagues, students, and friends.
Catuscia’s scientific interests include, in chronological order, principles of
programming languages, concurrency theory, security, and privacy. She has become
one of the most influential scientists in each of these areas and, although they do not
seem closely related, Catuscia has moved from one to another by doing seminal work
thatinterconnectedthem.Totracebackherprolificscientificcareer,wehighlightjusta
few of her most influential papers; it would be impossible to do justice to her entire
body of work in a preface.
Catuscia’s scientific journey began in the mid-eighties at the University of Pisa in
the area of principles of declarative programming languages, in particular logic and
functional programming. Some of her most influential papers in this period provided
the semantic foundations for some representative declarative languages [17, 18]. She
also introduced a notion that became largely studied in the logic programming
community: the S-Semantics [16].
Herworkondeclarativeprogrammingledhertothedomainofconcurrentconstraint
programming (ccp), a family of declarative languages where concurrency can be
naturally expressed. Catuscia published seminal papers on logical and semantic
foundationsofccplanguages.Herworkintroducedthefirstfullyabstractmodelforccp
[9], andprovided an elegantproof theory for thecorrectness of ccp programs [7]. She
also worked on a generalization of ccp to account for temporal concurrent behavior
[20]. In general, Catuscia’s work on ccp helped bring it to the attention of the
concurrency theory community.
In the nineties, while working on ccp at CWI in Holland and under the influence
oftheDutchprocessalgebracommunity,Catusciabecameinterestedinprocessalgebra
and concurrency theory at large. Her work at the time introduced the notion of
embedding as a tool for language comparison [10]. She also helped developed a
process algebra theory that can be regarded as a kernel for languages based on
asynchronous communication [8]. A few years later at the University of Genoa, she
went on to publish one of the most important papers on the expressiveness of process
algebra, contradicting conventional wisdom by showing that the p-calculus, a central
viii Preface
formalismfromconcurrencytheory,wasundercertainnaturalconditionsstrictlymore
expressive than its asynchronous version [21]. In the late nineties at Penn State
University, she proved that a probabilistic extension of the asynchronous p-calculus
was as expressive as the same probabilistic extension of the p-calculus [19]. Catuscia
became interested in the interplay between non-deterministic and probabilistic
concurrent behavior, which ultimately led her to the next step in her scientific career.
Intheearly2000sCatusciamovedtoInriaatLIX,ÉcolePolytechnique.Herinterest
inprobabilisticconcurrencyand,moregenerally,theformalizationofprobabilisticand
non-deterministic concurrent systems, led her to a long and prolific journey on formal
approachestosecurityandprivacy.Asalways,hercontributionsspanawidevarietyof
topics, to name a few: probabilistic and non-deterministic characterizations of
anonymity [6, 22, 23], foundational contributions to information-theoretic approaches
to information hiding [11, 13, 14], the influential g-leakage framework [2–4] for
quantitative information flow, more recent research on statistical disclosure control,
including an insightful metric-based generalization of differential privacy [12] and its
very influential application to location privacy, known as geo-indistinguishability [5],
applicationsofgametheory[1],andfinallyapplicationsofmachinelearningtoprivacy
[15].
Catuscia’s scientific journey continues. While developing her ever more
sophisticated probabilistic approaches to security and privacy, her interests in
probability and statistics themselves deepened, and, as mentioned, she has recently
started to focus on the connections between privacy and machine learning. A few
months ago, she was awarded an ERC Advanced grant to further explore these
connections. We all look forward to the great contributions she will most definitely
deliver from this new challenge.
We would like to conclude by expressing our gratitude to all the authors and the
reviewers that helped us honor Catuscia with this book. We thank EasyChair for
providingexcellenttoolsforpapersubmission, reviewing,andtheproductionofthese
proceedings. We thank Springer for their cooperation in publishing this volume.
Finally,weareindebtedtoLIX, ÉcolePolytechniqueand InriaSaclay for fundingthe
eventforthepresentationofthisbook.WethankCatuscia’sdaughter,NadiaMiller,for
drawing a beautiful portrait of her mother for this book.
References
1. Alvim, M.S., Chatzikokolakis, K., Kawamoto, Y., Palamidessi, C.: A game-theoretic
approach toinformation-flow control viaprotocol composition. Entropy 20(5),382(2018)
2. Alvim, M.S., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., Smith, G.:
Additiveandmultiplicativenotionsofleakage,andtheircapacities.In:CSF.pp.308–322.
IEEEComputer Society (2014)
3. Alvim, M.S., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., Smith, G.:
Axioms for information leakage. In:CSF. pp.77–92.IEEE Computer Society (2016)
4. Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring information
leakage using generalized gain functions. In: CSF. pp. 265–279. IEEE Computer Society
(2012)
Preface ix
5. Andrés, M.E., Bordenabe, N.E., Chatzikokolakis, K., Palamidessi, C.:
Geo-indistinguishability: differential privacy for location-based systems. In: ACM Confer-
enceonComputer andCommunications Security. pp. 901–914.ACM (2013)
6. Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: CONCUR. LNCS, vol. 3653,
pp.171–185.Springer(2005)
7. deBoer,F.S.,Gabbrielli,M.,Marchiori,E.,Palamidessi,C.:Provingconcurrentconstraint
programs correct. ACM Trans. Program. Lang.Syst.19(5), 685–725(1997)
8. de Boer, F.S., Klop, J.W., Palamidessi, C.: Asynchronous communication in pro-cess
algebra. In:LICS. pp.137–147.IEEEComputer Society (1992)
9. de Boer, F.S., Palamidessi, C.: A fully abstract model for concurrent constraint program-
ming.In: TAPSOFT,Vol.1. LNCS,vol.493,pp. 296–319. Springer(1991)
10. deBoer,F.S.,Palamidessi,C.:Embeddingasatoolforlanguagecomparison.Inf.Comput.
108(1), 128–157(1994)
11. Braun,C.,Chatzikokolakis,K.,Palamidessi,C.:Quantitativenotionsofleakageforone-try
attacks.Electr. Notes Theor.Comput.Sci. 249,75–91(2009)
12. Chatzikokolakis,K.,Andrés,M.E.,Bordenabe,N.E.,Palamidessi,C.:Broadeningthescope
ofdifferentialprivacyusingmetrics.In:PrivacyEnhancingTechnologies.LNCS,vol.7981,
pp.82–102.Springer(2013)
13. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy
channels. Inf.Comput. 206(2–4), 378–401(2008)
14. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the bayes risk in
information-hiding protocols.Journal of Computer Security 16(5), 531–571(2008)
15. Cherubin, G., Chatzikokolakis, K., Palamidessi, C.: F-BLEAU: fast black-box leak-age
estimation. In: Symposium on Security and Privacy. pp. 1307–1324. IEEE Computer
Society (2019)
16. Falaschi,M.,Levi,G.,Martelli,M.,Palamidessi,C.:Anewdeclarativesemanticsforlogic
languages. In: ICLP/SLP.pp.993–1005.MITPress (1988)
17. Falaschi,M.,Levi,G.,Palamidessi,C.,Martelli,M.:Declarativemodelingoftheoperational
behaviorof logic languages. Theor.Comput.Sci. 69(3),289–318(1989)
18. Giovannetti, E., Levi, G., Moiso, C., Palamidessi, C.: Kernel-leaf: A logic plus functional
language. J.Comput. Syst.Sci. 42(2),139–185(1991)
19. Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous pi-calculus. In: FoS-SaCS.
LNCS,vol.1784, pp.146–160.Springer(2000)
20. Nielsen,M.,Palamidessi,C.,Valencia,F.D.:Temporalconcurrentconstraintprogramming:
Denotation, logic andapplications. Nord.J.Comput. 9(1),145–188(2002)
21. Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous
pi-calculi. Mathematical Structures in Computer Science 13(5),685–719(2003)
22. Palamidessi, C.: Anonymity in probabilistic and nondeterministic systems. Electr. Notes
Theor.Comput. Sci.162, 277–279(2006)
23. Palamidessi, C.: Probabilistic and nondeterministic aspects of anonymity. Electr. Notes
Theor.Comput. Sci.155, 33–42(2006)
August 2019 Mário S. Alvim
Kostas Chatzikokolakis
Carlos Olarte
Frank Valencia
Organization
Additional Reviewers
Aranda, Jesus Knight, Sophia
Ayala-Rincón, Maurício Laneve, Cosimo
Blanco, Roberto Lanotte, Ruggero
Bonchi, Filippo Malacaria, Pasquale
Boreale, Michele McIver, Annabelle
Brodo, Linda Morgan, Carroll
Bruni, Roberto Nigam, Vivek
Cacciagrano, Diletta Romana Panangaden, Prakash
Carbone, Marco Parker, Dave
Castiglioni, Valentina Perchy, Salim
Degano, Pierpaolo Pino Duque, Luis Fernando
Deng, Yuxin Rocha, Camilo
Elsalamouny, Ehab Rueda, Camilo
Falaschi, Moreno Sangiorgi, Davide
Ferrari, Gianluigi Santini, Francesco
Gabbrielli, Maurizio Schwarzentruber, François
Gadducci, Fabio Smith, Geoffrey
Gorla, Daniele Tini, Simone
Gorrieri, Roberto Tiu, Alwen
Goubault-Larrecq, Jean Toninho, Bernardo
Guzmán, Michell van Glabbeek, Rob
Kawamoto, Yusuke Zanasi, Fabio
Khouzani, Arman Mhr