Efficient Non-interactive Secure Computation

DOI10.1007/978-3-642-20465-4_23zbMath1290.94151OpenAlexW1567505539MaRDI QIDQ3003395

Eyal Kushilevitz, Manoj Prabhakaran, Yuval Ishai, Rafail Ostrovsky, Amit Sahai

Publication date: 27 May 2011

Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_23

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (43)

On the round complexity of secure quantum computation ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Two-round MPC: information-theoretic and black-box ⋮ Round optimal black-box ``commit-and-prove ⋮ Perfectly secure oblivious parallel RAM ⋮ Pattern matching on encrypted streams ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Cryptography with One-Way Communication ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Black-box reusable NISC with random oracles ⋮ Privacy-preserving blueprints ⋮ Private polynomial commitments and applications to MPC ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Authenticated garbling from simple correlations ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Verifiable private information retrieval ⋮ The hunting of the SNARK ⋮ Reusable secure computation in the plain model ⋮ Cryptography from one-way communication: on completeness of finite channels ⋮ No-Key Protocol for Deniable Encryption ⋮ Deniability of Symmetric Encryption Based on Computational Indistinguishability from Probabilistic Ciphering ⋮ Secure quantum computation with classical communication ⋮ Blockchains enable non-interactive MPC ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Non-interactive secure computation from one-way functions ⋮ Unnamed Item ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ What security can we achieve within 4 rounds? ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Abuse resistant law enforcement access systems ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Succinct non-interactive secure computation

This page was built for publication: Efficient Non-interactive Secure Computation