2012•Unpublished venueRequires access

Universally composable adaptive oblivious transfer

Matthew Green, Susan Hohenberger

Open publisher page 94 citations

Abstract

In an oblivious transfer (OT) protocol, a Sender with messages M1,..., MN and a Receiver with indices σ1,..., σk ∈ [1, N] interact in such a way that at the end the Receiver obtains

About this research paper

What this paper is about

In an oblivious transfer (OT) protocol, a Sender with messages M1,..., MN and a Receiver with indices σ1,..., σk ∈ [1, N] interact in such a way that at the end the Receiver obtains

Why it matters

OpenAlex reports 94 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

In an oblivious transfer (OT) protocol, a Sender with messages M1,..., MN and a Receiver with indices σ1,..., σk ∈ [1, N] interact in such a way that at the end the Receiver obtains

Key concepts: Oblivious transfer, Communication source, Computer science, Protocol (science), Mathematical proof, Block (permutation group theory), Bilinear interpolation, Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Universally composable adaptive oblivious transfer — Research Paper | ScholarLens