3 citations · 7 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CR2022★ 1 cited
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…
cs.PL2022★ 2 cited
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…