An efficient protocol for fair secure two-party computation

M.S. Kiraz, B. Schoenmakers

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

9 Citaten (Scopus)
1 Downloads (Pure)

Samenvatting

the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits. Later, several protocols based on garbled circuits covering malicious adversaries have been proposed. Only a few papers, however, discuss the fundamental property of fairness for two-party computation. So far the protocol by Pinkas (Eurocrypt 2003) is the only one which deals with fairness for Yao’s garbled circuit approach. In this paper, we improve upon Pinkas’ protocol by presenting a more efficient variant, which includes several modifications including one that fixes a subtle security problem with the computation of the so-called majority circuit. We prove the security of our protocol according to the real/ideal simulation paradigm, as Lindell and Pinkas recently did for the malicious case (Eurocrypt 2007).
Originele taal-2Engels
TitelTopics in Cryptology - CT-RSA 2008 (Proceedings of The Cryptographers' Track at the RSA Conference 2008, San Francisco CA, USA, April 8-11, 2008)
RedacteurenT.G. Malkin
Plaats van productieBerlin
UitgeverijSpringer
Pagina's88-105
ISBN van geprinte versie978-3-540-79262-8
DOI's
StatusGepubliceerd - 2008

Publicatie series

NaamLecture Notes in Computer Science
Volume4964
ISSN van geprinte versie0302-9743

Vingerafdruk

Duik in de onderzoeksthema's van 'An efficient protocol for fair secure two-party computation'. Samen vormen ze een unieke vingerafdruk.

Citeer dit