TY - GEN
T1 - Better two-round adaptive multi-party computation
AU - Canetti, Ran
AU - Poburinnaya, Oxana
AU - Venkitasubramaniam, Muthuramakrishnan
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2017.
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 -