Generalized oblivious transfer protocols based on noisy channels

DOI10.1007/3-540-45116-1_22MaRDI QIDQ4330555zbMATH OpenFDO

Authors Valeri Korjik, Kirill E. Morozov

Publication date 13 May 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2052/20520219

zbMATH Keywords

bit commitmentcryptographic primitivesnoisy channelsoblivious transferRényi entropy

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Security in Communication Networks
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
• Oblivious Transfer from Weak Noisy Channels
• On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions
• Building oblivious transfer on channel delays

Cited in

(6)

• A light-weight bit commitment protocol based on unpredictable channel noise
• Building oblivious transfer on channel delays
• NOISE TOLERANCE OF THE BB84 PROTOCOL WITH RANDOM PRIVACY AMPLIFICATION
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
• Constant-rate oblivious transfer from noisy channels
• Security in Communication Networks

This page was built for publication: Generalized oblivious transfer protocols based on noisy channels

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