Constant-rate oblivious transfer from noisy channels

DOI10.1007/978-3-642-22792-9_38MaRDI QIDQ5199219zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger

Publication date 12 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_38

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Security in Communication Networks
• Oblivious Transfer from Weak Noisy Channels
• scientific article; zbMATH DE number 1739893
• Building oblivious transfer on channel delays
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation

Cited in

(14)

• Secure two-party computation over unreliable channels
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Asymptotically quasi-optimal cryptography
• Building oblivious transfer on channel delays
• Secure two-party computation over a Z-channel
• Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
• Simultaneous secrecy and reliability amplification for a general channel model
• Secret Sharing Schemes with Algebraic Properties and Applications
• Cryptography with One-Way Communication
• On oblivious transfer capacity
• Secure non-interactive simulation from arbitrary joint distributions
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• A new framework for quantum oblivious transfer
• Four families of squares of BCH codes and their complements

This page was built for publication: Constant-rate oblivious transfer from noisy channels

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