Arithmetic Garbling from Bilinear Maps

Fleischhacker N, Malavolta G, Schröder D (2019)

Publication Type: Conference contribution

Publication year: 2019

Journal

Lecture Notes in Computer Science Springer Verlag

Publisher: Springer

Book Volume: 11736 LNCS

Pages Range: 172-192

Conference Proceedings Title: Computer Security – ESORICS 2019

Event location: Luxembourg LU

ISBN: 9783030299613

DOI: 10.1007/978-3-030-29962-0_9

Abstract

We consider the problem of garbling arithmetic circuits and present a garbling scheme for inner-product predicates over exponentially large fields. Our construction stems from a generic transformation from predicate encryption which makes only blackbox calls to the underlying primitive. The resulting garbling scheme has practical efficiency and can be used as a garbling gadget to securely compute common arithmetic subroutines. We also show that inner-product predicates are complete by generically bootstrapping our construction to arithmetic garbling for polynomial-size circuits, albeit with a loss of concrete efficiency. In the process of instantiating our construction we propose two new predicate encryption schemes, which might be of independent interest. More specifically, we construct (i) the first pairing-free (weakly) attribute-hiding non-zero inner-product predicate encryption scheme, and (ii) a key-homomorphic encryption scheme for linear functions from bilinear maps. Both schemes feature constant-size keys and practical efficiency.

Authors with CRIS profile

Dominique Schröder Lehrstuhl für Informatik 13 (Angewandte Kryptographie)

Involved external institutions

Ruhr-Universität Bochum (RUB) DE Germany (DE) Carnegie Mellon University US United States (USA) (US)

How to cite

APA:

Fleischhacker, N., Malavolta, G., & Schröder, D. (2019). Arithmetic Garbling from Bilinear Maps. In Kazue Sako, Steve Schneider, Peter Y.A. Ryan (Eds.), Computer Security – ESORICS 2019 (pp. 172-192). Luxembourg, LU: Springer.

MLA:

Fleischhacker, Nils, Giulio Malavolta, and Dominique Schröder. "Arithmetic Garbling from Bilinear Maps." Proceedings of the 24th European Symposium on Research in Computer Security, ESORICS 2019, Luxembourg Ed. Kazue Sako, Steve Schneider, Peter Y.A. Ryan, Springer, 2019. 172-192.

BibTeX: Download