Hierarchy for classes of garbling schemes

: Tommi Meskanen, Valtteri Niemi, Noora Nieminen

: Xiaoyun Jia, Yunchao Xing

: International Conference on Information and Communications Technologies

: 2015

Studia Scientiarum Mathematicarum Hungarica

: 2014 International Conference on Information and Communications Technologies (ICT 2014)

: 52

: 2

: 154

: 175

: 22

: 978-1-84919-843-1

: 0081-6906

DOI: https://doi.org/10.1556/012.2015.52.2.1315

Recently, privacy has become one of the hottest topics in the world of the Internet-based communications and computation. Many applications, such as cloud computing and various

cloud services, require information security and privacy. However, in many cases the level of security in current solutions is insufficient. Methods to ensure secure multiparty computation have been studied for decades, but because of the needs of the modern computation this topic has recently become increasingly popular. Yao’s garbled circuit is one method to compute a function f on an argument x privately without revealing any information about f and x except f(x) . Unfortunately, current constructions for garbled circuits have limitations - either efficient construction at the cost of reusability or reusability at the cost of efficiency. In this paper

we aim at somewhere between these two extremes by defining new security measures for garbling schemes. These definitions support design of reusable garbled circuits that achieve adaptive security even when the function argument is handled bitwise. Moreover, we show how the new classes are related to the existing security classes of garbling schemes. As a result, we obtain an extended hierarchy for the classes of garbling schemes.