Open Access
Review

Table 2.

Comparison of concretely efficient garbling schemes

Garbling schemes Size of one GCa Calls to function H per gate
Assumption
(κ bits per gate)
Garbler
Evaluator
AND XOR AND XOR AND XOR
Unoptimized textbook Yao [6, 190] 8 8 4 4 2.5 2.5 PRFb
Yao with point-permute [1, 191] 4 4 4 4 1 1 PRF
4-to-3 GRR [192] 3 3 4 4 1 1 PRF
4-to-2 GRR [193] 2 2 4 4 1 1 PRF
Free XOR [194] 3 0 4 0 1 0 Circular CRHF
Flexible XOR [200] 2 {0, 1, 2} 4 {0, 2, 4} 1 {0, 1, 2} Circular CRHF
Half gates [195] 2 0 4 0 2 0 Circular CRHF
Fast 4-to-2 GRR [201] 2 1 4 3 2 1.5 PRF
Slicing and dicing [199] 1.5 0 ≤6 0 ≤3 0 Circular CRHF

aFor GC size, a small constant additive term (i.e., 5 bits) is ignored for [199].

bWe use PRF to denote pseudo-random function.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.