3 citations · 7 across the 4 of their papers we have counts for
4 papers
A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem
Mohammad Anagreh, Peeter Laud
In this paper, we present a secure multiparty computation (SMC) protocol for single-source shortest distances (SSSD) in undirected graphs, where the location of edges is public, bu…
ZK-SecreC: a Domain-Specific Language for Zero Knowledge Proofs
Dan Bogdanov, Joosep Jääger, Peeter Laud +6
We present ZK-SecreC, a domain-specific language for zero-knowledge proofs. We present the rationale for its design, its syntax and semantics, and demonstrate its usefulness on the…
Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes
Peeter Laud, Alisa Pankova
There are numerous methods of achieving -differential privacy (DP). The question is what is the appropriate value of , since there is no common agreement on a "sufficiently s…
Achieving Differential Privacy using Methods from Calculus
Peeter Laud, Alisa Pankova, Martin Pettai
We introduce derivative sensitivity, an analogue to local sensitivity for continuous functions. We use this notion in an analysis that determines the amount of noise to be added to…