Better two-round adaptive multi-party computation

Ran Canetti; Oxana Poburinnaya; Muthuramakrishnan Venkitasubramaniam

doi:10.1007/978-3-662-54388-7_14

Better two-round adaptive multi-party computation

Ran Canetti, Oxana Poburinnaya^*, Muthuramakrishnan Venkitasubramaniam

^*Corresponding author for this work

School of Computer Science

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

8 Scopus citations

Abstract

The only known two-round multi-party computation protocol that withstands adaptive corruption of all parties is the ingenious protocol of Garg and Polychroniadou [TCC 15]. We present protocols that improve on the GP protocol in a number of ways. First, concentrating on the semi-honest case and taking a different approach than GP, we show a two-round, adaptively secure protocol where: - Only a global (i.e., non-programmable) reference string is needed. In contrast, in GP the reference string is programmable, even in the semi-honest case. - Only polynomially-secure indistinguishability obfuscation for circuits and injective one way functions are assumed. In GP, subexponentially secure IO is assumed. Second, we show how to make the GP protocol have only RAM complexity, even for Byzantine corruptions. For this we construct the first statistically-sound non-interactive Zero-Knowledge scheme with RAM complexity.

Original language	English
Title of host publication	Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
Editors	Serge Fehr
Publisher	Springer Verlag
Pages	396-427
Number of pages	32
ISBN (Print)	9783662543870
DOIs	https://doi.org/10.1007/978-3-662-54388-7_14
State	Published - 2017
Event	20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 - Amsterdam, Netherlands Duration: 28 Mar 2017 → 31 Mar 2017

Publication series

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

Conference

Conference	20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017
Country/Territory	Netherlands
City	Amsterdam
Period	28/03/17 → 31/03/17

Access to Document

10.1007/978-3-662-54388-7_14

Cite this

Canetti, R., Poburinnaya, O., & Venkitasubramaniam, M. (2017). Better two-round adaptive multi-party computation. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (pp. 396-427). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10175 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-54388-7_14

Canetti, Ran ; Poburinnaya, Oxana ; Venkitasubramaniam, Muthuramakrishnan. / Better two-round adaptive multi-party computation. Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. editor / Serge Fehr. Springer Verlag, 2017. pp. 396-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1d5e33002fbe47d080ca71fe19b7dc86,

title = "Better two-round adaptive multi-party computation",

abstract = "The only known two-round multi-party computation protocol that withstands adaptive corruption of all parties is the ingenious protocol of Garg and Polychroniadou [TCC 15]. We present protocols that improve on the GP protocol in a number of ways. First, concentrating on the semi-honest case and taking a different approach than GP, we show a two-round, adaptively secure protocol where: - Only a global (i.e., non-programmable) reference string is needed. In contrast, in GP the reference string is programmable, even in the semi-honest case. - Only polynomially-secure indistinguishability obfuscation for circuits and injective one way functions are assumed. In GP, subexponentially secure IO is assumed. Second, we show how to make the GP protocol have only RAM complexity, even for Byzantine corruptions. For this we construct the first statistically-sound non-interactive Zero-Knowledge scheme with RAM complexity.",

author = "Ran Canetti and Oxana Poburinnaya and Muthuramakrishnan Venkitasubramaniam",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2017.; 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 ; Conference date: 28-03-2017 Through 31-03-2017",

year = "2017",

doi = "10.1007/978-3-662-54388-7_14",

language = "אנגלית",

isbn = "9783662543870",

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

publisher = "Springer Verlag",

pages = "396--427",

editor = "Serge Fehr",

booktitle = "Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings",

}

Canetti, R, Poburinnaya, O & Venkitasubramaniam, M 2017, Better two-round adaptive multi-party computation. in S Fehr (ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10175 LNCS, Springer Verlag, pp. 396-427, 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017, Amsterdam, Netherlands, 28/03/17. https://doi.org/10.1007/978-3-662-54388-7_14

Better two-round adaptive multi-party computation. / Canetti, Ran; Poburinnaya, Oxana; Venkitasubramaniam, Muthuramakrishnan.
Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. ed. / Serge Fehr. Springer Verlag, 2017. p. 396-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10175 LNCS).

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

TY - GEN

T1 - Better two-round adaptive multi-party computation

AU - Canetti, Ran

AU - Poburinnaya, Oxana

AU - Venkitasubramaniam, Muthuramakrishnan

PY - 2017

Y1 - 2017

N2 - The only known two-round multi-party computation protocol that withstands adaptive corruption of all parties is the ingenious protocol of Garg and Polychroniadou [TCC 15]. We present protocols that improve on the GP protocol in a number of ways. First, concentrating on the semi-honest case and taking a different approach than GP, we show a two-round, adaptively secure protocol where: - Only a global (i.e., non-programmable) reference string is needed. In contrast, in GP the reference string is programmable, even in the semi-honest case. - Only polynomially-secure indistinguishability obfuscation for circuits and injective one way functions are assumed. In GP, subexponentially secure IO is assumed. Second, we show how to make the GP protocol have only RAM complexity, even for Byzantine corruptions. For this we construct the first statistically-sound non-interactive Zero-Knowledge scheme with RAM complexity.

AB - The only known two-round multi-party computation protocol that withstands adaptive corruption of all parties is the ingenious protocol of Garg and Polychroniadou [TCC 15]. We present protocols that improve on the GP protocol in a number of ways. First, concentrating on the semi-honest case and taking a different approach than GP, we show a two-round, adaptively secure protocol where: - Only a global (i.e., non-programmable) reference string is needed. In contrast, in GP the reference string is programmable, even in the semi-honest case. - Only polynomially-secure indistinguishability obfuscation for circuits and injective one way functions are assumed. In GP, subexponentially secure IO is assumed. Second, we show how to make the GP protocol have only RAM complexity, even for Byzantine corruptions. For this we construct the first statistically-sound non-interactive Zero-Knowledge scheme with RAM complexity.

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

U2 - 10.1007/978-3-662-54388-7_14

DO - 10.1007/978-3-662-54388-7_14

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

AN - SCOPUS:85014468727

SN - 9783662543870

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

SP - 396

EP - 427

BT - Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings

A2 - Fehr, Serge

PB - Springer Verlag

T2 - 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017

Y2 - 28 March 2017 through 31 March 2017

ER -

Canetti R, Poburinnaya O, Venkitasubramaniam M. Better two-round adaptive multi-party computation. In Fehr S, editor, Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Springer Verlag. 2017. p. 396-427. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-54388-7_14

Better two-round adaptive multi-party computation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this