Computationally secure oblivious transfer

DOI10.1007/S00145-004-0102-6MaRDI QIDQ1777283zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Oblivious transfer and polynomial evaluation
• Efficient oblivious transfer protocols
• Efficient k-out-of-n oblivious transfer schemes
• scientific article; zbMATH DE number 1952770
• Information Security

Cited in

(27)

• Secure computation using leaky correlations (asymptotically optimal constructions)
• Optimal forgeries against polynomial-based MACs and GCM
• Statistical ZAPR arguments from bilinear maps
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Accelerating oblivious transfer with batch multi-exponentiation
• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
• Adaptive oblivious transfer and generalization
• scientific article; zbMATH DE number 2085428 (Why is no real title available?)
• Security of blind signatures under aborts and applications to adaptive oblivious transfer
• Fully-Simulatable Oblivious Set Transfer
• New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
• Oblivious Transfer Is Symmetric
• Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
• scientific article; zbMATH DE number 1952770 (Why is no real title available?)
• Efficient oblivious transfers with access control
• scientific article; zbMATH DE number 1418318 (Why is no real title available?)
• Oblivious-Transfer Amplification
• Information Security
• Round Optimal Universally Composable Oblivious Transfer Protocols
• Theory of Cryptography
• Adaptive oblivious transfer with access control from lattice assumptions
• Local differential privacy protocol for making key-value data robust against poisoning attacks
• Efficient Traceable Oblivious Transfer and Its Applications
• Generalized oblivious transfer by secret sharing
• Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices
• A poisoning-resilient LDP schema leveraging oblivious transfer with the Hadamard transform

This page was built for publication: Computationally secure oblivious transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777283)