Dishonest Majority Multi-Party Computation for Binary Circuits

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationAdvances in Cryptology - CRYPTO 2014
EditorsJuan A. Garay, Rosario Gennaro
PublisherSpringer
ChapterPart II
Pages495-512
Number of pages18
Volume8617
ISBN (Electronic)9783662443811
ISBN (Print)9783662443804
DOIs
Publication statusPublished - 17 Aug 2014
EventAnnual International Cryptology Conference 2014: Advances in Cryptology – CRYPTO 2014 34th Annual Cryptology Conference, Santa Barbara, CA, USA - Santa Barbara, United States
Duration: 17 Aug 201421 Aug 2014
https://link.springer.com/book/10.1007/978-3-662-44371-2

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Conference

ConferenceAnnual International Cryptology Conference 2014
Abbreviated titleCRYPTO 2014
Country/TerritoryUnited States
CitySanta Barbara
Period17/08/1421/08/14
Internet address

Fingerprint

Dive into the research topics of 'Dishonest Majority Multi-Party Computation for Binary Circuits'. Together they form a unique fingerprint.
  • COED - Computing on Encrypted Data

    Smart, N. P. (Principal Investigator)

    1/10/1130/09/15

    Project: Research

Cite this