2013•Unpublished venueRequires access

Fast two-party secure computation with minimal assumptions

Abhi A. Shelat, Chih-Hao Shen

Abstract

Almost all existing protocols for secure two-party computation require a specific hardness assumption, such as DDH, discrete logarithm, or a random oracle, even after assuming oracle access to the oblivious transfer functionality for their correctness and/or efficiency. We propose and implement a Yao-based protocol that is secure against malicious adversaries and enjoys the following benefits:

About this research paper

What this paper is about

Why it matters

OpenAlex reports 84 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Random oracle, Correctness, Oblivious transfer, Computer science, Discrete logarithm, Oracle, Secure multi-party computation, Computation