Improved OT extension for transferring short secrets

DOI10.1007/978-3-642-40084-1_4MaRDI QIDQ2849386zbMATH OpenOpenAlexFDO

Authors Vladimir Kolesnikov, Ranjit Kumaresan

Publication date 17 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40084-1_4

zbMATH Keywords

1-out-of-\(n\) OT1-out-of-2 OToblivious transfer (OT) extension

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• More efficient oblivious transfer extensions
• More efficient oblivious transfer extensions with security for malicious adversaries
• SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
• Extending oblivious transfer with low communication via key-homomorphic PRFs
• The simplest protocol for oblivious transfer

Cited in

(31)

• Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
• Masked triples. Amortizing multiplication triples across conditionals
• Private set operations from oblivious switching
• PSI-stats: private set intersection protocols supporting secure statistical functions
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
• Efficient, actively secure MPC with a dishonest majority: a survey
• More efficient oblivious transfer extensions
• Adaptively code-correlation robustness functions and its applications to private set intersection
• \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
• More efficient oblivious transfer extensions with security for malicious adversaries
• Actively secure 1-out-of-N OT extension with application to private set intersection
• Actively secure OT extension with optimal overhead
• Statistically secure linear-rate dimension extension for oblivious affine function evaluation
• Non-interactive secure 2PC in the offline/online and batch settings
• TinyKeys: a new approach to efficient multi-party computation
• Structure-aware private set intersection, with applications to fuzzy matching
• Non-interactive secure computation of inner-product from LPN and LWE
• SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
• Private join and compute from PIR with default
• Batching base oblivious transfers
• Half-tree: halving the cost of tree expansion in COT and DPF
• Enabling scalable and unlinkable payment channel hubs with oblivious puzzle transfer
• Constant-round multiparty private function evaluation with (quasi-)linear complexities
• Predicate private set intersection with linear complexity
• Secure approximate nearest neighbor search with locality-sensitive hashing
• Private set operations from multi-query reverse private membership test
• Garbled circuit lookup tables with logarithmic number of ciphertexts
• Improved domain extender for the ideal cipher

This page was built for publication: Improved OT extension for transferring short secrets

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