-
Notifications
You must be signed in to change notification settings - Fork 78
/
Copy pathmpyc.mpctools.html
70 lines (66 loc) · 6.05 KB
/
mpyc.mpctools.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><title>Python: module mpyc.mpctools</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head><body bgcolor="#f0f0f8">
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="heading">
<tr bgcolor="#7799ee">
<td valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"> <br><big><big><strong><a href="mpyc.html"><font color="#ffffff">mpyc</font></a>.mpctools</strong></big></big></font></td
><td align=right valign=bottom
><font color="#ffffff" face="helvetica, arial"><a href=".">index</a><br><a href="https://github.com/lschoe/mpyc/blob/v0.10/mpyc/mpctools.py">github.com/lschoe/mpyc/blob/v0.10/mpyc/mpctools.py</a></font></td></tr></table>
<p><tt>This module currently provides alternative implementations for two<br>
functions in Python's itertools and functools modules, respectively.<br>
<br>
The alternative implementations can be used as drop-in replacements, however,<br>
potentially enhancing the performance when used in secure computations. More<br>
specifically, these implementations are aimed at reducing the overall round<br>
complexity, possible at the expense of increasing overall space complexity,<br>
time complexity, and communication complexity.</tt></p>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#aa55cc">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Modules</strong></big></font></td></tr>
<tr><td bgcolor="#aa55cc"><tt> </tt></td><td> </td>
<td width="100%"><table width="100%" summary="list"><tr><td width="25%" valign=top><a href="https://docs.python.org/3/library/operator.html">operator</a><br>
</td><td width="25%" valign=top></td><td width="25%" valign=top></td><td width="25%" valign=top></td></tr></table></td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#eeaa77">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Functions</strong></big></font></td></tr>
<tr><td bgcolor="#eeaa77"><tt> </tt></td><td> </td>
<td width="100%"><dl><dt><a name="-accumulate"><strong>accumulate</strong></a>(x, f=<built-in function add>, initial=<no value>)</dt><dd><tt>For associative function f of two arguments, make an iterator that returns<br>
the accumulated results over all (nonempty) prefixes of the given iterable x.<br>
<br>
The applications of f are arranged such that the maximum depth is logarithmic<br>
in the number of elements of x, potentially at the cost of increasing the total<br>
number of applications of f by a logarithmic factor as well.<br>
<br>
In contrast, Python's itertools.<a href="#-accumulate">accumulate</a>() higher-order function arranges<br>
the applications of f in a linear fashion, as in general it cannot be assumed<br>
that f is associative (and that the arguments to f are even of the same type).<br>
<br>
If initial is provided (possibly equal to None), the accumulation leads off<br>
with this initial value so that the output has one more element than the input<br>
iterable. Otherwise, the number of elements output matches the input iterable x.</tt></dd></dl>
<dl><dt><a name="-reduce"><strong>reduce</strong></a>(f, x, initial=<no value>)</dt><dd><tt>Apply associative function f of two arguments to the items of iterable x.<br>
<br>
The applications of f are arranged in a binary tree of logarithmic depth,<br>
thus limiting the overall round complexity of the secure computation.<br>
<br>
In contrast, Python's functools.<a href="#-reduce">reduce</a>() higher-order function arranges<br>
the applications of f in a linear chain (a binary tree of linear depth),<br>
and in this case f is not required to be associative; the arguments to f<br>
may even be of different types.<br>
<br>
If initial is provided (possibly equal to None), it is placed before the<br>
items of x (hence effectively serves as a default when x is empty). If no<br>
initial value is given and x contains only one item, that item is returned.</tt></dd></dl>
</td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#55aa55">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Data</strong></big></font></td></tr>
<tr><td bgcolor="#55aa55"><tt> </tt></td><td> </td>
<td width="100%"><strong>runtime</strong> = None</td></tr></table>
</body></html>