Precomputing oblivious transfer

DOI10.1007/3-540-44750-4_8MaRDI QIDQ4343426zbMATH OpenFDO

Authors Donald Beaver

Publication date 1 December 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_8

zbMATH Keywords

one-out-of-two oblivious transferprecomputing oblivious transferquantum OT device

Mathematics Subject Classification ID

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

Recommendations

• Oblivious-Transfer Amplification
• Efficient oblivious transfer protocols
• Quantum Oblivious Transfer
• scientific article; zbMATH DE number 1952770

Cited in

(40)

• Private computation using a PEZ dispenser.
• Oblivious transfer in incomplete networks
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• High-performance multi-party computation for binary circuits based on oblivious transfer
• An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
• Broadcast-optimal two-round MPC
• Lower and upper bounds on the randomness complexity of private computations of AND
• Efficient, actively secure MPC with a dishonest majority: a survey
• On the feasibility of extending oblivious transfer
• \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
• High-precision secure computation of satellite collision probabilities
• Network oblivious transfer
• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• Oblivious Transfer Is Symmetric
• Oblivious Transfer Based on the McEliece Assumptions
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• Lower and upper bounds on the randomness complexity of private computations of AND
• On perfectly secure 2PC in the OT-hybrid model
• On perfectly secure 2PC in the OT-hybrid model
• Correction to: ``Topology-hiding communication from minimal assumptions
• Structure-aware private set intersection, with applications to fuzzy matching
• Round-optimal black-box secure computation from two-round malicious OT
• Random sources in private computation
• Attaining GOD beyond honest majority with friends and foes
• Quadratic multiparty randomized encodings beyond honest majority and their applications
• Half-tree: halving the cost of tree expansion in COT and DPF
• Malicious secure, structure-aware private set intersection
• Toward malicious constant-rate 2PC via arithmetic garbling
• Fast public-key silent OT and more from constrained Naor-Reingold
• Multi-party computation with conversion of secret sharing
• Secure multiparty computation with identifiable abort via vindicating release
• \textsf{LR-OT}: leakage-resilient oblivious transfer
• Multi-key homomorphic secret sharing
• Hybrid encryption in correlated randomness model and KEM combiners
• \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
• QuietOT: lightweight oblivious transfer with a public-key setup
• Communication lower bounds for cryptographic broadcast protocols
• \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication

This page was built for publication: Precomputing oblivious transfer

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