Coding constructions for efficient oblivious transfer from noisy channels
We consider oblivious transfer protocols performed over binary symmetric channels in a malicious setting where parties will actively cheat if they can. We provide constructions purely based on coding theory that achieve an explicit positive rate, the essential ingredient being the existence of linea...
Saved in:
Main Authors: | Oggier, Frédérique, Zemor, Gilles |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/162520 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Optimal bounds for parity-oblivious random access codes
by: Chailloux, A, et al.
Published: (2020) -
Three new constructions of optimal linear codes with few weights
by: Cheng, Yingjie, et al.
Published: (2024) -
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
by: Luo, Gaojun, et al.
Published: (2022) -
CSS-like constructions of asymmetric quantum codes
by: Ezerman, Martianus Frederic, et al.
Published: (2019) -
Linear authentication codes: Bounds and constructions
by: Wang, H., et al.
Published: (2014)