1 code implementation • 4 Dec 2019 • Gamal Elkoumy, Stephan A. Fahrenkrog-Petersen, Marlon Dumas, Peeter Laud, Alisa Pankova, Matthias Weildich
In this setting, this paper proposes an approach for constructing and querying a common type of artifact used for process mining, namely the frequency and time-annotated Directly-Follows Graph (DFG), over multiple event logs belonging to different parties, in such a way that the parties do not share the event logs with each other.
Cryptography and Security
no code implementations • 28 Nov 2019 • Peeter Laud, Alisa Pankova
In this paper, we show how to compute $\epsilon$ that corresponds to $\delta$, defined as the adversary's advantage in probability of guessing some specific property of the output.