Garbled Circuit for 4 Valued Logic

Abstract

Garbled circuit is the main tool to realize 2 party computation. Garbled circuit computes the output C (x, y) of the circuit C while hiding the inputs x, y. For 2 valued logic, there were many studies about the garbled circuit for Boolean circuit. Recently, Lindel et al. proposed the first garbled circuit construction for 3 valued logic. In this paper, we propose the first garbled circuit construction for 4 valued logic. The proposed construction is a natural extension of the Lindell et al.'s garbled circuit construction. Intuitively, in the proposed construction, we represent 4 valued logic circuit by Boolean circuit, and then apply Boolean garbled circuit construction to obtain 4 valued garbled circuit. The proposed construction reduces the number of ciphertexts to 4 from 16 of naive Yao's construction. In this paper, we propose the first garbled circuit construction for 4 valued logic. The proposed construction is a natural extension of the Lindell et al.'s garbled circuit construction. Intuitively, in the proposed construction, we represent 4 valued logic circuit by Boolean circuit, and then apply Boolean garbled circuit construction to obtain 4 valued garbled circuit. The proposed construction reduces the number of ciphertexts to 4 from 16 of naive Yao's construction.