On the Power of Public-Key Encryption in Secure Computation

DOI10.1007/978-3-642-54242-8_11zbMath1326.94112OpenAlexW2234834167MaRDI QIDQ5746340

Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran

Publication date: 18 February 2014

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_11

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

One-way functions imply secure computation in a quantum world ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Secure non-interactive simulation: feasibility and rate ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: On the Power of Public-Key Encryption in Secure Computation