Computationally secure oblivious transfer

DOI10.1007/s00145-004-0102-6zbMath1075.68026OpenAlexW2023951105MaRDI QIDQ1777283

Moni Naor, Benny Pinkas

Publication date: 13 May 2005

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-004-0102-6

zbMATH Keywords

computationally secure protocolstransfer protocol

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (16)

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Local differential privacy protocol for making key-value data robust against poisoning attacks ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ Efficient Traceable Oblivious Transfer and Its Applications ⋮ Generalized oblivious transfer by secret sharing ⋮ Efficient oblivious transfers with access control ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Security of blind signatures under aborts and applications to adaptive oblivious transfer ⋮ Round Optimal Universally Composable Oblivious Transfer Protocols ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

This page was built for publication: Computationally secure oblivious transfer