Perfect secure computation in two rounds

DOI10.1007/978-3-030-03807-6_6zbMath1443.94042OpenAlexW2795240423MaRDI QIDQ1629404

Zvika Brakerski, Rotem Tsabary, Benny Applebaum

Publication date: 11 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_6

zbMATH Keywords

multi-party functionalityperfect correctnessperfect semi-honest securitytwo-round protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Two-round MPC: information-theoretic and black-box ⋮ Optimal bounded-collusion secure functional encryption ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ SCALES. MPC with small clients and larger ephemeral servers ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ On actively-secure elementary MPC reductions ⋮ On communication models and best-achievable security in two-round MPC ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Broadcast-optimal two-round MPC

Cites Work

• Unnamed Item
• Unnamed Item
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Advances in cryptology -- EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 -- May 3, 2018. Proceedings. Part III
• Round-optimal secure multiparty computation with honest majority
• Security and composition of multiparty cryptographic protocols
• Computationally private randomizing polynomials and their applications
• A minimal model for secure computation (extended abstract)
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Garbled Circuits as Randomized Encodings of Functions: a Primer
• Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator