On the Round Complexity of Black-Box Secure MPC

[1]  Carmit Hazay,et al.  Round-Optimal Secure Multi-party Computation , 2018, Journal of Cryptology.

[2]  Hoeteck Wee,et al.  Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More , 2020, IACR Cryptol. ePrint Arch..

[3]  Daniele Venturi,et al.  A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement , 2019, TCC.

[4]  Yuval Ishai,et al.  Efficient Pseudorandom Correlation Generators: Silent OT Extension and More , 2019, IACR Cryptol. ePrint Arch..

[5]  Ivan Damgård,et al.  Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures , 2019, IACR Cryptol. ePrint Arch..

[6]  Rafail Ostrovsky,et al.  Reusable Non-Interactive Secure Computation , 2019, IACR Cryptol. ePrint Arch..

[7]  Fabrice Benhamouda,et al.  k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits , 2018, EUROCRYPT.

[8]  Yael Tauman Kalai,et al.  Promise Zero Knowledge and its Applications to Round Optimal MPC , 2018, IACR Cryptol. ePrint Arch..

[9]  Dakshita Khurana,et al.  Round Optimal Concurrent Non-malleability from Polynomial Hardness , 2017, TCC.

[10]  Yuval Ishai,et al.  Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model , 2017, Journal of Cryptology.

[11]  Shai Halevi,et al.  Four Round Secure Computation Without Setup , 2017, TCC.

[12]  Amit Sahai,et al.  Round Optimal Concurrent MPC via Strong Simulation , 2017, TCC.

[13]  Arka Rai Choudhuri,et al.  A New Approach to Round-Optimal Secure Multiparty Computation , 2017, CRYPTO.

[14]  Rafail Ostrovsky,et al.  Edinburgh Research Explorer Four-Round Concurrent Non-Malleable Commitments from One-Way Functions , 2016 .

[15]  Payman Mohassel,et al.  Non-interactive Secure 2PC in the Offline/Online and Batch Settings , 2017, EUROCRYPT.

[16]  Rafail Ostrovsky,et al.  Concurrent Non-Malleable Commitments (and More) in 3 Rounds , 2016, CRYPTO.

[17]  Yuval Ishai,et al.  Secure Protocol Transformations , 2016, CRYPTO.

[18]  Divesh Aggarwal,et al.  Optimal Computational Split-state Non-malleable Codes , 2016, TCC.

[19]  Rafail Ostrovsky,et al.  Round-Optimal Black-Box Two-Party Computation , 2015, CRYPTO.

[20]  Stefan Dziembowski,et al.  Leakage-Resilient Non-malleable Codes , 2015, TCC.

[21]  Benny Pinkas,et al.  Non-Interactive Secure Computation Based on Cut-and-Choose , 2014, IACR Cryptol. ePrint Arch..

[22]  Vinod Vaikuntanathan,et al.  Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.

[23]  Rafail Ostrovsky,et al.  Efficient Non-interactive Secure Computation , 2011, EUROCRYPT.

[24]  Anat Paskin-Cherniavsky,et al.  Secure Multiparty Computation with Minimal Interaction , 2010, CRYPTO.

[25]  Yuval Ishai,et al.  Secure Arithmetic Computation with No Honest Majority , 2008, IACR Cryptol. ePrint Arch..

[26]  Yuval Ishai,et al.  Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.

[27]  Yuval Ishai,et al.  Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.

[28]  Rafail Ostrovsky,et al.  Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.

[29]  Luca Trevisan,et al.  Notions of Reducibility between Cryptographic Primitives , 2004, TCC.

[30]  Yuval Ishai,et al.  Extending Oblivious Transfers Efficiently , 2003, CRYPTO.