Checkpoint the party/runtime stack before share-program and malicious-mode work.
Ship the TLS mesh, composer, Beaver/Yao/leaf MPC, prep/online paths, apps, and docs so the tree is pushable before elevating share_expr, security_mode, and prep resume. Co-authored-by: Cursor <cursoragent@cursor.com>
This commit is contained in:
parent
695f8e84f7
commit
0d22946a0e
1835 changed files with 170291 additions and 2849 deletions
|
|
@ -169,7 +169,121 @@ USENIX Security 2021. Full version:
|
|||
|
||||
One public reconstruction per newly opened wire.
|
||||
|
||||
**Used in** [Beaver triples](@ref beaver_triples) · [Guided tour](@ref tour_beaver)
|
||||
**Used in** [Beaver triples](@ref beaver_triples) · [Arithmetic share runtime](@ref arith_runtime) · [Guided tour](@ref tour_beaver)
|
||||
|
||||
### ABY {#bib_aby}
|
||||
|
||||
Daniel Demmler, Thomas Schneider, and Michael Zohner.
|
||||
*ABY — A Framework for Efficient Mixed-Protocol Secure Two-Party Computation.*
|
||||
NDSS 2015.
|
||||
[ePrint 2014/386](https://eprint.iacr.org/2014/386)
|
||||
|
||||
Arithmetic / boolean / Yao sharing and conversions.
|
||||
|
||||
**Used in** [Arithmetic share runtime](@ref arith_runtime) · [A boolean function of a leaf](@ref yao_leaf)
|
||||
|
||||
### Half-gates {#bib_halfgates}
|
||||
|
||||
Samee Zahur, Mike Rosulek, and David Evans.
|
||||
*Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates.*
|
||||
EUROCRYPT 2015.
|
||||
[ePrint 2014/756](https://eprint.iacr.org/2014/756)
|
||||
|
||||
Free-XOR AND rows. `yao::session` sends two blocks per AND.
|
||||
|
||||
**Used in** [A boolean function of a leaf](@ref yao_leaf) · [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### Garbling gadgets {#bib_garble_gadgets}
|
||||
|
||||
Marshall Ball, Tal Malkin, and Mike Rosulek.
|
||||
*Garbling Gadgets for Boolean and Arithmetic Circuits.*
|
||||
CCS 2016.
|
||||
[ePrint 2016/969](https://eprint.iacr.org/2016/969)
|
||||
|
||||
Free addition and public scaling in `(Z_m)^k`, and a unary projection of
|
||||
`m − 1` ciphertexts. A fan-in-`b` symmetric gate is a projection of the sum.
|
||||
`arith_garble.hpp` is this gadget. The session in `beaver.hpp` stays the
|
||||
interactive one-open product.
|
||||
|
||||
**Used in** [Beaver triples](@ref beaver_triples) · [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### Stacked garbling {#bib_stacked}
|
||||
|
||||
David Heath and Vladimir Kolesnikov.
|
||||
*Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path.*
|
||||
CRYPTO 2020.
|
||||
[ePrint 2020/973](https://eprint.iacr.org/2020/973)
|
||||
|
||||
One XOR-stack of the branch materials. Inactive branches are rebuilt from seeds.
|
||||
|
||||
**Used in** [A boolean function of a leaf](@ref yao_leaf)
|
||||
|
||||
### One-hot garbling {#bib_onehot}
|
||||
|
||||
David Heath and Vladimir Kolesnikov.
|
||||
*One Hot Garbling.*
|
||||
CCS 2021.
|
||||
|
||||
The same stack over `k` branches. The demux carries the inactive seeds.
|
||||
|
||||
**Used in** [A boolean function of a leaf](@ref yao_leaf)
|
||||
|
||||
### FLUTE {#bib_flute}
|
||||
|
||||
Andreas Brüggemann, Robin Hundt, Thomas Schneider, Ajith Suresh, and Hossein Yalame.
|
||||
*FLUTE: Fast and Secure Lookup Table Evaluations.*
|
||||
IEEE S&P 2023.
|
||||
[ePrint 2023/499](https://eprint.iacr.org/2023/499)
|
||||
|
||||
A public LUT is a multi-fan-in inner product on ABY2.0 masked bits.
|
||||
Online cost is two bits per output bit.
|
||||
|
||||
**Used in** [Beaver triples](@ref beaver_triples) · [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### ABY3 {#bib_aby3}
|
||||
|
||||
Payman Mohassel and Peter Rindal.
|
||||
*ABY3: A Mixed Protocol Framework for Machine Learning.*
|
||||
CCS 2018.
|
||||
[ePrint 2018/403](https://eprint.iacr.org/2018/403)
|
||||
|
||||
Honest-majority 3PC, RSS, probabilistic truncation, matrix triples.
|
||||
|
||||
**Used in** [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### edaBits / CrypTFlow2 {#bib_edabits}
|
||||
|
||||
Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, and Peter Scholl.
|
||||
*Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.*
|
||||
CRYPTO 2020.
|
||||
[ePrint 2020/338](https://eprint.iacr.org/2020/338)
|
||||
|
||||
**Used in** [Arithmetic share runtime](@ref arith_runtime) · [A boolean function of a leaf](@ref yao_leaf)
|
||||
|
||||
### EzPC {#bib_ezpc}
|
||||
|
||||
Nishanth Chandran, Divya Gupta, Aseem Rastogi, Rahul Sharma, and Shardul Tripathi.
|
||||
*EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning.*
|
||||
EuroS&P 2019.
|
||||
[ePrint 2017/1109](https://eprint.iacr.org/2017/1109)
|
||||
|
||||
**Used in** [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### Gilboa multiplication {#bib_gilboa}
|
||||
|
||||
Niv Gilboa.
|
||||
*Two Party RSA Key Generation.*
|
||||
CRYPTO 1999, LNCS 1666, pp. 116–129.
|
||||
|
||||
**Used in** [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### Sharemind {#bib_sharemind}
|
||||
|
||||
Dan Bogdanov, Sven Laur, and Jan Willemson.
|
||||
*Sharemind: A Framework for Fast Privacy-Preserving Computations.*
|
||||
ESORICS 2008, LNCS 5283, pp. 192–206.
|
||||
|
||||
**Used in** [Arithmetic share runtime](@ref arith_runtime)
|
||||
|
||||
### Beaver triples {#bib_beaver}
|
||||
|
||||
|
|
@ -221,6 +335,22 @@ Offset Horner is not that piecewise-polynomial construction.
|
|||
|
||||
**Used in** [Grotto](@ref jet_and_ring) · [Guided tour](@ref tour_grotto)
|
||||
|
||||
### Wave Hello {#bib_wave}
|
||||
|
||||
José Reis, Mehmet Ugurbil, Sameer Wagh, Ryan Henry, and Miguel de Vega.
|
||||
*Wave Hello to Privacy: Efficient Mixed-Mode MPC using Wavelet Transforms.*
|
||||
PoPETs 2025(2), pp. 697–718.
|
||||
<a href="https://doi.org/10.56553/popets-2025-0083">Publisher</a> ·
|
||||
[ePrint 2025/013](https://eprint.iacr.org/2025/013) ·
|
||||
<a href="reis-ugurbil-wagh-henry-de-vega-wave-hello-eprint-2025-013.pdf">PDF</a>
|
||||
|
||||
Equations (7) and (8) are the cleartext Haar and bior(5,3) lookup.
|
||||
`make_haar_dwt_lut` and `make_bior53_dwt_lut` evaluate those tables.
|
||||
The online phase pairs Haar with a deterministic Pika truncation and
|
||||
bior(5,3) with segment parity.
|
||||
|
||||
**Used in** [Wavelet lookup tables](@ref dwt_luts) · [Guided tour](@ref tour_grotto)
|
||||
|
||||
## Protocols {#bib_sec_protocols}
|
||||
|
||||
### Duoram {#bib_duoram}
|
||||
|
|
@ -379,3 +509,7 @@ The DPF work is a prepaid wildcard unit vector, rotated once the
|
|||
address is opened.
|
||||
|
||||
**Used in** [MPC SUBLEQ](@ref app_subleq)
|
||||
|
||||
\htmlonly
|
||||
<div class="tldr"><b>TL;DR.</b> The point key is ePrint 2018/707, not the longer EUROCRYPT 2015 key. Proofs and cuckoo multipoint are 2021/580. Comparisons are 2020/1392. The dealer-free opening is 2017/827, and the pads are IKNP plus the 2015/267 base OT. Three-party spines are 2024/1658. The information-theoretic table is 2023/028. Grotto is 2023/108.</div>
|
||||
\endhtmlonly
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue