Dishonest Majority Multi-Party Computation for Binary Circuits

Enrique Larraia De Vega; Emmanuela Orsini; Nigel P. Smart

doi:10.1007/978-3-662-44381-1_28

Dishonest Majority Multi-Party Computation for Binary Circuits

Enrique Larraia De Vega, Emmanuela Orsini, Nigel P. Smart

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

42 Citations (Scopus)

Abstract

We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen et al.

Original language	English
Title of host publication	Advances in Cryptology - CRYPTO 2014
Editors	Juan A. Garay, Rosario Gennaro
Publisher	Springer
Chapter	Part II
Pages	495-512
Number of pages	18
Volume	8617
ISBN (Electronic)	9783662443811
ISBN (Print)	9783662443804
DOIs	https://doi.org/10.1007/978-3-662-44381-1_28
Publication status	Published - 17 Aug 2014
Event	Annual International Cryptology Conference 2014: Advances in Cryptology – CRYPTO 2014 34th Annual Cryptology Conference, Santa Barbara, CA, USA - Santa Barbara, United States Duration: 17 Aug 2014 → 21 Aug 2014 https://link.springer.com/book/10.1007/978-3-662-44371-2

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer

Conference

Conference	Annual International Cryptology Conference 2014
Abbreviated title	CRYPTO 2014
Country/Territory	United States
City	Santa Barbara
Period	17/08/14 → 21/08/14
Internet address	https://link.springer.com/book/10.1007/978-3-662-44371-2

Access to Document

10.1007/978-3-662-44381-1_28

https://eprint.iacr.org/2014/101

Handle.net

Persistent link

COED - Computing on Encrypted Data
Smart, N. P. (Principal Investigator)
1/10/11 → 30/09/15
Project: Research

Cite this

@inproceedings{edea31d4b2384fca877dd9b699f376c6,

title = "Dishonest Majority Multi-Party Computation for Binary Circuits",

abstract = "We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen et al.",

author = "{Larraia De Vega}, Enrique and Emmanuela Orsini and Smart, {Nigel P.}",

year = "2014",

month = aug,

day = "17",

doi = "10.1007/978-3-662-44381-1_28",

language = "English",

isbn = "9783662443804",

volume = "8617",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "495--512",

editor = "Garay, {Juan A.} and Rosario Gennaro",

booktitle = "Advances in Cryptology - CRYPTO 2014",

note = "Annual International Cryptology Conference 2014 : Advances in Cryptology – CRYPTO 2014 34th Annual Cryptology Conference, Santa Barbara, CA, USA, CRYPTO 2014 ; Conference date: 17-08-2014 Through 21-08-2014",

url = "https://link.springer.com/book/10.1007/978-3-662-44371-2",

}

Larraia De Vega, E, Orsini, E & Smart, NP 2014, Dishonest Majority Multi-Party Computation for Binary Circuits. in JA Garay & R Gennaro (eds), Advances in Cryptology - CRYPTO 2014. vol. 8617, LNCS 8617, Lecture Notes in Computer Science, Springer, pp. 495-512, Annual International Cryptology Conference 2014, Santa Barbara, United States, 17/08/14. https://doi.org/10.1007/978-3-662-44381-1_28

Dishonest Majority Multi-Party Computation for Binary Circuits. / Larraia De Vega, Enrique; Orsini, Emmanuela; Smart, Nigel P.
Advances in Cryptology - CRYPTO 2014. ed. / Juan A. Garay; Rosario Gennaro. Vol. 8617 Springer, 2014. p. 495-512 LNCS 8617 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Dishonest Majority Multi-Party Computation for Binary Circuits

AU - Larraia De Vega, Enrique

AU - Orsini, Emmanuela

AU - Smart, Nigel P.

PY - 2014/8/17

Y1 - 2014/8/17

N2 - We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen et al.

AB - We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring pairwise authentications into global authentications. As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen et al.

U2 - 10.1007/978-3-662-44381-1_28

DO - 10.1007/978-3-662-44381-1_28

M3 - Conference Contribution (Conference Proceeding)

SN - 9783662443804

VL - 8617

T3 - Lecture Notes in Computer Science

SP - 495

EP - 512

BT - Advances in Cryptology - CRYPTO 2014

A2 - Garay, Juan A.

A2 - Gennaro, Rosario

PB - Springer

T2 - Annual International Cryptology Conference 2014

Y2 - 17 August 2014 through 21 August 2014

ER -

Dishonest Majority Multi-Party Computation for Binary Circuits

Abstract

Publication series

Conference

Access to Document

Handle.net

Fingerprint

Projects

COED - Computing on Encrypted Data

Cite this