Reusable non-interactive secure computation

DOI10.1007/978-3-030-26954-8_15zbMath1506.68014OpenAlexW2950462542MaRDI QIDQ2304929

Vinod Vaikuntanathan, Yuval Ishai, Daniel Kraschewski, Melissa Chase, Yevgeniy Dodis, Tianren Liu, Rafail Ostrovsky

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_15

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computer security (68M25)

Related Items (16)

On the round complexity of secure quantum computation ⋮ On the round complexity of black-box secure MPC ⋮ Round-optimal black-box protocol compilers ⋮ Asymptotically quasi-optimal cryptography ⋮ Batch-OT with optimal rate ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Black-box reusable NISC with random oracles ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Secure quantum computation with classical communication ⋮ Blockchains enable non-interactive MPC ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors

This page was built for publication: Reusable non-interactive secure computation