The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)

DOI10.1007/978-3-030-64378-2_20zbMath1485.94050OpenAlexW3113519358MaRDI QIDQ2119061

Arpita Patra, Benny Applebaum, Eliran Kachlon

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_20

zbMATH Keywords

cryptographic protocolsround complexitysecure computationinformation-theoretic cryptography

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15)

Related Items (5)

Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ The round complexity of statistical MPC with optimal resiliency

This page was built for publication: The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)