On Garbling Schemes With And Without Privacy

Abstract. In recent years, a lot of progress has been made on speeding up Actively-secure Twoparty Function Evaluation (SFE) using Garbled Circuits. For a given level of security, the amount of information that has to be sent and evaluated has been drastically reduced due to approaches that optimize the garbling method for the gates (such as Free-XOR [17], Flex-OR [16] and Half-Gates [26]). Moreover, the total number of garbled circuits sent to the evaluator dropped by a factor of 3, mostly due to the Forge-and-Lose-technique [3,18,12]. In another line of work, Frederiksen et al. [7] introduced the first special purpose garbling technique, namely a garbling scheme without privacy guarantees. In this note, we present an approach to combine such a privacy-free garbling scheme with an arbitrary SFE protocol for a certain class of circuits, such that the overall protocol is actively secure. This then yields a SFE protocol that has a smaller overhead in total. We instantiate our approach w...

• Type: Journal
• Year: 2016
• Where: IACR
• Authors: Carsten Baum
• Keywords: Biometrics, IACR 2016