Adaptively secure two-party computation from indistinguishability obfuscation

Ran Canetti; Shafi Goldwasser; Oxana Poburinnaya

doi:10.1007/978-3-662-46497-7_22

Adaptively secure two-party computation from indistinguishability obfuscation

Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya

School of Computer Science

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

34 Scopus citations

Abstract

We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible for one of the parties, and fully leakage tolerant. It requires a global (nonprogrammable) reference string and is based on one way functions and general-purpose indistinguishability obfuscation with sub-exponential security, as well as augmented non-committing encryption. A Byzantine version of the protocol, obtained by applying the Canetti et al. [STOC 02] compiler, achieves UC security with comparable efficiency parameters, but is no longer incoercible.¹.

Original language	English
Title of host publication	Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
Editors	Yevgeniy Dodis, Jesper Buus Nielsen
Publisher	Springer Verlag
Pages	557-585
Number of pages	29
ISBN (Electronic)	9783662464960
DOIs	https://doi.org/10.1007/978-3-662-46497-7_22
State	Published - 2015
Event	12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland Duration: 23 Mar 2015 → 25 Mar 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9015
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th Theory of Cryptography Conference, TCC 2015
Country/Territory	Poland
City	Warsaw
Period	23/03/15 → 25/03/15

Access to Document

10.1007/978-3-662-46497-7_22

Cite this

Canetti, R., Goldwasser, S., & Poburinnaya, O. (2015). Adaptively secure two-party computation from indistinguishability obfuscation. In Y. Dodis, & J. B. Nielsen (Eds.), Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings (pp. 557-585). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9015). Springer Verlag. https://doi.org/10.1007/978-3-662-46497-7_22

Canetti, Ran ; Goldwasser, Shafi ; Poburinnaya, Oxana. / Adaptively secure two-party computation from indistinguishability obfuscation. Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. editor / Yevgeniy Dodis ; Jesper Buus Nielsen. Springer Verlag, 2015. pp. 557-585 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6504a6b469e8408d859a81fe9137c337,

title = "Adaptively secure two-party computation from indistinguishability obfuscation",

abstract = "We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible for one of the parties, and fully leakage tolerant. It requires a global (nonprogrammable) reference string and is based on one way functions and general-purpose indistinguishability obfuscation with sub-exponential security, as well as augmented non-committing encryption. A Byzantine version of the protocol, obtained by applying the Canetti et al. [STOC 02] compiler, achieves UC security with comparable efficiency parameters, but is no longer incoercible.1.",

author = "Ran Canetti and Shafi Goldwasser and Oxana Poburinnaya",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2015.; 12th Theory of Cryptography Conference, TCC 2015 ; Conference date: 23-03-2015 Through 25-03-2015",

year = "2015",

doi = "10.1007/978-3-662-46497-7_22",

language = "אנגלית",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "557--585",

editor = "Yevgeniy Dodis and Nielsen, {Jesper Buus}",

booktitle = "Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings",

}

Canetti, R, Goldwasser, S & Poburinnaya, O 2015, Adaptively secure two-party computation from indistinguishability obfuscation. in Y Dodis & JB Nielsen (eds), Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9015, Springer Verlag, pp. 557-585, 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, 23/03/15. https://doi.org/10.1007/978-3-662-46497-7_22

Adaptively secure two-party computation from indistinguishability obfuscation. / Canetti, Ran; Goldwasser, Shafi; Poburinnaya, Oxana.
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. ed. / Yevgeniy Dodis; Jesper Buus Nielsen. Springer Verlag, 2015. p. 557-585 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9015).

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

TY - GEN

T1 - Adaptively secure two-party computation from indistinguishability obfuscation

AU - Canetti, Ran

AU - Goldwasser, Shafi

AU - Poburinnaya, Oxana

N1 - Publisher Copyright: © International Association for Cryptologic Research 2015.

PY - 2015

Y1 - 2015

N2 - We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible for one of the parties, and fully leakage tolerant. It requires a global (nonprogrammable) reference string and is based on one way functions and general-purpose indistinguishability obfuscation with sub-exponential security, as well as augmented non-committing encryption. A Byzantine version of the protocol, obtained by applying the Canetti et al. [STOC 02] compiler, achieves UC security with comparable efficiency parameters, but is no longer incoercible.1.

AB - We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible for one of the parties, and fully leakage tolerant. It requires a global (nonprogrammable) reference string and is based on one way functions and general-purpose indistinguishability obfuscation with sub-exponential security, as well as augmented non-committing encryption. A Byzantine version of the protocol, obtained by applying the Canetti et al. [STOC 02] compiler, achieves UC security with comparable efficiency parameters, but is no longer incoercible.1.

UR - http://www.scopus.com/inward/record.url?scp=84924377090&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-46497-7_22

DO - 10.1007/978-3-662-46497-7_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84924377090

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 557

EP - 585

BT - Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings

A2 - Dodis, Yevgeniy

A2 - Nielsen, Jesper Buus

PB - Springer Verlag

T2 - 12th Theory of Cryptography Conference, TCC 2015

Y2 - 23 March 2015 through 25 March 2015

ER -

Canetti R, Goldwasser S, Poburinnaya O. Adaptively secure two-party computation from indistinguishability obfuscation. In Dodis Y, Nielsen JB, editors, Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Springer Verlag. 2015. p. 557-585. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-46497-7_22

Adaptively secure two-party computation from indistinguishability obfuscation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this