On Reusable Projective Garbling Schemes

Abstract

The popularity of network-based computation has increased during the past years. Storing data and performing computations using for example cloud services is commonplace nowadays. However, the information security in network-based computation rarely is satisfactory. One technique to improve information security for networked computations is based on secure multiparty computations. The idea of multiparty computation originates from Yao, who considered the secure computation with two parties by introducing the technique called garbled circuits. The technique was then generalized, but still the exact definitions for different security measures were not established until Bellare, Hoang and Rogaway proposed a definition of a garbling scheme and several security notions for garbling schemes. This gave inspiration to study the security properties of garbling schemes from different perspectives, including adaptivity and reusability. In this paper, we study the adaptive security for a certain type of reusable garbling schemes. First, we consider general constraints to achieve security for this specific type of garbling schemes. Then we analyze the adaptive security classes of reusable garbling schemes. More specifically, we prove a relation between security classes that has been left open in earlier research.