Pille Pullonen

dblp:143/4454 · also Pille Pullonen-Raudvere · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-3255-7001ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 6 · 2 first-author · 3 since 2021Security and privacy · 1
YearPublicationVenuePosition
2025 Towards Trusted Service Monitoring: Verifiable Service Level Agreements
Fernando Castillo, Eduardo Brito, Sebastian Werner 0001, Pille Pullonen, Jonathan Heiss
ICSOC (2)4
2025 Model-based verification of data protection mechanisms in collaborative business processes
Sara Belluccini, Rocco De Nicola, Marlon Dumas, Pille Pullonen, Barbara Re 0001, Francesco Tiezzi 0001
Softw. Syst. Model.4
2022 Multi-level privacy analysis of business processes: the Pleak toolset
Marlon Dumas, Luciano García-Bañuelos, Joosep Jääger, Peeter Laud, Raimundas Matulevicius, Alisa Pankova, Martin Pettai, Pille Pullonen, Aivo Toots, Reedik Tuuling, Maksym Yerokhin
Int. J. Softw. Tools Technol. Transf.8
2019 Business Process Privacy Analysis in Pleak
abstract
Pleak is a tool to capture and analyze privacy-enhanced business process models to characterize and quantify to what extent the outputs of a process leak information about its inputs. Pleak incorporates an extensible set of analysis plugins, which enable users to inspect potential leakages at multiple levels of detail.
Aivo Toots, Reedik Tuuling, Maksym Yerokhin, Marlon Dumas, Luciano García-Bañuelos, Peeter Laud, Raimundas Matulevicius, Alisa Pankova, Martin Pettai, Pille Pullonen, Jake Tom
FASE10
2019 Privacy-enhanced BPMN: enabling data privacy analysis in business processes models
Pille Pullonen, Jake Tom, Raimundas Matulevicius, Aivo Toots
Softw. Syst. Model.1
2017 PE-BPMN: Privacy-Enhanced Business Process Model and Notation
Pille Pullonen, Raimundas Matulevicius, Dan Bogdanov
BPM1
2014 From Input Private to Universally Composable Secure Multi-party Computation Primitives
abstract
Secure multi-party computation systems are commonly built from a small set of primitive components. The compos ability of security notions has a central role in the analysis of such systems, as it allows us to deduce security properties of complex protocols from the properties of its components. We show that the standard notions of universally compos able security are overly restrictive in this context and can lead to protocols with sub-optimal performance. As a remedy, we introduce a weaker notion of privacy that is satisfied by simpler protocols and is preserved by composition. After that we fix a passive security model and show how to convert a private protocol into a universally compos able protocol. As a result, we obtain modular security proofs without performance penalties.
Dan Bogdanov, Peeter Laud, Sven Laur, Pille Pullonen
CSF4