Concurrent Oblivious Transfer

Abstract

We consider the problem of designing an efficient oblivious transfer (OT) protocol that is provably secure in a concurrent setting, i.e., where many OT sessions may be running concurrently with their messages interleaved arbitrarily. Known OT protocols use zero-knowledge proofs, and no concurrent zero-knowledge proofs are known that use less than a poly… (More)
DOI: 10.1109/SFCS.2000.892120

Topics

3 Figures and Tables

Statistics

0102030'02'04'06'08'10'12'14'16'18
Citations per Year

152 Citations

Semantic Scholar estimates that this publication has 152 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics