Efficient fully-simulatable oblivious transfer

DOI10.4086/CJTCS.2008.006MaRDI QIDQ5414569zbMATH OpenOpenAlexFDO

Authors Yehuda Lindell

Publication date 6 May 2014

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/cjtcs.2008.006

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient Fully-Simulatable Oblivious Transfer
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
• Simulatable Adaptive Oblivious Transfer
• Efficient oblivious transfer protocols
• scientific article; zbMATH DE number 1952770

Cited in

(13)

• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Rate-limited secure function evaluation
• Fully-Simulatable Oblivious Set Transfer
• Efficiency-improved fully simulatable adaptive OT under the DDH assumption
• Efficient concurrent oblivious transfer in super-polynomial-simulation security
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Blind Identity-Based Encryption and Simulatable Oblivious Transfer
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Efficient Fully-Simulatable Oblivious Transfer
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
• Knowledge encryption and its applications to simulatable protocols with low round-complexity

This page was built for publication: Efficient fully-simulatable oblivious transfer

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