Table 1 Secure subprotocols used in this paper
From: Efficient privacy-preserving variable-length substring match for genome sequence
| Â | Input | Output |
|---|---|---|
\(\mathsf {Equality}\) | \([\![x]\!]\), \([\![y]\!]\) | \([\![z]\!]^B\) s.t. \(z = 1\) if \(x = y\) otherwise \(z = 0\) |
\(\mathsf {Comp}\) | \([\![x]\!]\), \([\![y]\!]\) | \([\![z]\!]^B\) s.t. \(z = 1\) if \(x < y\) otherwise \(z = 0\) |
\(\mathsf {CastUp}\) | \([\![x]\!] \in \mathbb {Z}_{2^n}\), \(n'\) | \([\![x]\!] \in \mathbb {Z}_{2^{n'}}\) (\(n < n'\)) |
\(\mathsf {B2A}\) | \([\![x]\!]^B\) | \([\![x]\!]\) |
\(\mathsf {Choose}\) | \([\![x]\!]\), \([\![y]\!]\), \([\![e \in \{0,1\}]\!]\) | \([\![z]\!]\) s.t. \(z = x\) if \(e = 1\), otherwise (\(e = 0\)) \(z = y\) |