Threshold Garbled Circuits and Ad Hoc Secure Computation

Michele Ciampi; Vipul Goyal; Rafail Ostrovsky

doi:10.1007/978-3-030-77883-5_3

Threshold Garbled Circuits and Ad Hoc Secure Computation

Michele Ciampi, Vipul Goyal, Rafail Ostrovsky

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

Garbled Circuits (GCs) represent fundamental and powerful tools in cryptography, and many variants of GCs have been considered since their introduction. An important property of the garbled circuits is that they can be evaluated securely if and only if exactly 1 key for each input wire is obtained: no less and no more. In this work we study the case when: 1) some of the wire-keys are missing, but we are still interested in computing the output of the garbled circuit and 2) the evaluator of the GC might have both keys for a constant number of wires. We start to study this question in terms of non-interactive multi-party computation (NIMPC) which is strongly connected with GCs. In this notion there is a fixed number of parties (n) that can get correlated information from a trusted setup. Then these parties can send an encoding of their input to an evaluator, which can compute the output of the function. Similarly to the notion of ad hoc secure computation proposed by Beimel et al. [ITCS 2016], we consider the case when less than n parties participate in the online phase, and in addition we let these parties colluding with the evaluator. We refer to this notion as Threshold NIMPC.

Original language	English
Title of host publication	Advances in Cryptology -- EUROCRYPT 2021
Editors	Anne Canteaut, François-Xavier Standaert
Place of Publication	Cham
Publisher	Springer
Pages	64-93
Number of pages	30
ISBN (Electronic)	978-3-030-77883-5
ISBN (Print)	978-3-030-77882-8
DOIs	https://doi.org/10.1007/978-3-030-77883-5_3
Publication status	Published - 16 Jun 2021
Event	40th Annual International Conference on the Theory and Applications of Cryptographic Techniques - Zagreb, Croatia Duration: 17 Oct 2021 → 21 Oct 2021 https://eurocrypt.iacr.org/2021/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	12698
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	40th Annual International Conference on the Theory and Applications of Cryptographic Techniques
Abbreviated title	Eurocrypt 2021
Country/Territory	Croatia
City	Zagreb
Period	17/10/21 → 21/10/21
Internet address	https://eurocrypt.iacr.org/2021/

Keywords / Materials (for Non-textual outputs)

non-interactive multi-party computation
ad hoc private simultaneous messages
garbled circuits

Access to Document

10.1007/978-3-030-77883-5_3Licence: All Rights Reserved

Threshold Garbled Circuits_CIAMPI_DOA2412021_AFVAccepted author manuscript, 581 KBLicence: All Rights Reserved

https://link.springer.com/chapter/10.1007/978-3-030-77883-5_3Licence: All Rights Reserved

PRIViLEDGE: Privacy in Distributed Ledgers
Kiayias, A.
EU government bodies
1/01/18 → 30/06/21
Project: Research

Cite this

@inproceedings{e5e62586bf3e41d6aac25e257b973406,

title = "Threshold Garbled Circuits and Ad Hoc Secure Computation",

abstract = "Garbled Circuits (GCs) represent fundamental and powerful tools in cryptography, and many variants of GCs have been considered since their introduction. An important property of the garbled circuits is that they can be evaluated securely if and only if exactly 1 key for each input wire is obtained: no less and no more. In this work we study the case when: 1) some of the wire-keys are missing, but we are still interested in computing the output of the garbled circuit and 2) the evaluator of the GC might have both keys for a constant number of wires. We start to study this question in terms of non-interactive multi-party computation (NIMPC) which is strongly connected with GCs. In this notion there is a fixed number of parties (n) that can get correlated information from a trusted setup. Then these parties can send an encoding of their input to an evaluator, which can compute the output of the function. Similarly to the notion of ad hoc secure computation proposed by Beimel et al. [ITCS 2016], we consider the case when less than n parties participate in the online phase, and in addition we let these parties colluding with the evaluator. We refer to this notion as Threshold NIMPC.",

keywords = "non-interactive multi-party computation, ad hoc private simultaneous messages, garbled circuits",

author = "Michele Ciampi and Vipul Goyal and Rafail Ostrovsky",

year = "2021",

month = jun,

day = "16",

doi = "10.1007/978-3-030-77883-5_3",

language = "English",

isbn = "978-3-030-77882-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "64--93",

editor = "Anne Canteaut and Fran{\c c}ois-Xavier Standaert",

booktitle = "Advances in Cryptology -- EUROCRYPT 2021",

address = "United Kingdom",

note = "40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2021 ; Conference date: 17-10-2021 Through 21-10-2021",

url = "https://eurocrypt.iacr.org/2021/",

}

Ciampi, M, Goyal, V & Ostrovsky, R 2021, Threshold Garbled Circuits and Ad Hoc Secure Computation. in A Canteaut & F-X Standaert (eds), Advances in Cryptology -- EUROCRYPT 2021. Lecture Notes in Computer Science, vol. 12698, Springer, Cham, pp. 64-93, 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, 17/10/21. https://doi.org/10.1007/978-3-030-77883-5_3

TY - GEN

T1 - Threshold Garbled Circuits and Ad Hoc Secure Computation

AU - Ciampi, Michele

AU - Goyal, Vipul

AU - Ostrovsky, Rafail

PY - 2021/6/16

Y1 - 2021/6/16

N2 - Garbled Circuits (GCs) represent fundamental and powerful tools in cryptography, and many variants of GCs have been considered since their introduction. An important property of the garbled circuits is that they can be evaluated securely if and only if exactly 1 key for each input wire is obtained: no less and no more. In this work we study the case when: 1) some of the wire-keys are missing, but we are still interested in computing the output of the garbled circuit and 2) the evaluator of the GC might have both keys for a constant number of wires. We start to study this question in terms of non-interactive multi-party computation (NIMPC) which is strongly connected with GCs. In this notion there is a fixed number of parties (n) that can get correlated information from a trusted setup. Then these parties can send an encoding of their input to an evaluator, which can compute the output of the function. Similarly to the notion of ad hoc secure computation proposed by Beimel et al. [ITCS 2016], we consider the case when less than n parties participate in the online phase, and in addition we let these parties colluding with the evaluator. We refer to this notion as Threshold NIMPC.

AB - Garbled Circuits (GCs) represent fundamental and powerful tools in cryptography, and many variants of GCs have been considered since their introduction. An important property of the garbled circuits is that they can be evaluated securely if and only if exactly 1 key for each input wire is obtained: no less and no more. In this work we study the case when: 1) some of the wire-keys are missing, but we are still interested in computing the output of the garbled circuit and 2) the evaluator of the GC might have both keys for a constant number of wires. We start to study this question in terms of non-interactive multi-party computation (NIMPC) which is strongly connected with GCs. In this notion there is a fixed number of parties (n) that can get correlated information from a trusted setup. Then these parties can send an encoding of their input to an evaluator, which can compute the output of the function. Similarly to the notion of ad hoc secure computation proposed by Beimel et al. [ITCS 2016], we consider the case when less than n parties participate in the online phase, and in addition we let these parties colluding with the evaluator. We refer to this notion as Threshold NIMPC.

KW - non-interactive multi-party computation

KW - ad hoc private simultaneous messages

KW - garbled circuits

U2 - 10.1007/978-3-030-77883-5_3

DO - 10.1007/978-3-030-77883-5_3

M3 - Conference contribution

SN - 978-3-030-77882-8

T3 - Lecture Notes in Computer Science

SP - 64

EP - 93

BT - Advances in Cryptology -- EUROCRYPT 2021

A2 - Canteaut, Anne

A2 - Standaert, François-Xavier

PB - Springer

CY - Cham

T2 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques

Y2 - 17 October 2021 through 21 October 2021

ER -

Threshold Garbled Circuits and Ad Hoc Secure Computation

Abstract / Description of output

Publication series

Conference

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Projects

PRIViLEDGE: Privacy in Distributed Ledgers

Cite this