Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficient Cryptographic Protocols Based on Noisy Channels

Claude Crépeau

Published Jan 1, 1997• 169 citations
Publisher
DOI
10.1007/3-540-69053-0_21

Related papers

"Efficient cryptographic protocols based on noisy channels," Advances in Cryptology-EUROCRYPT'97

Claude Crépeau

•Jan 1, 1997•25 citations

Approaches to Efficient and Robust Cryptographic Protocols

Bartosz Przydatek

•Jan 1, 2007•0 citations

Efficient Cryptographic Protocols based on Noisy Channels

Claude Crépeau

. The Wire-Tap Channel of Wyner [19] shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a cryptographic scenario of two honest people facing an eavesdropper. Later Cr'epeau and Kilian [9] showed how a BSC may be used to implement Oblivious Transfer in a cryptographic scenario of two possibly dishonest people facing each other. Unfortunately this result is rather impractical as it requires\\Omega (n 11 ) bits to be transmitted through the BSC to accomplish a single OT. The current paper provides efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel. Our protocols respectively require sending O(n) and O(n 3 ) bits through the BSC. These results are based on a technique known as Generalized Privacy Amplification [1] that allow two people to extract secret information from partially compromised data. 1 Introduction The cryptographic power of a no...

•Jan 1, 1996•0 citations

On unconditionally secure oblivious transfer from continuous channels

Motohiko Isaka

In this paper, we consider an information theoretically secure cryptographic primitive known as oblivious transfer based on noisy channels. We present a protocol and two approaches to base the primitive on much wider class of signal sets and continuous channels than the existing results on the Gaussian channel. We also evaluate the associated information theoretic efficiency of the protocol for some cases of interest.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•4 citations

Position-Based Cryptography from Noisy Channels

Stefan Dziembowski, Maciej Zdanowicz

Lecture notes in computer science•Jan 1, 2014•9 citations

Generalized Oblivious Transfer Protocols Based on Noisy Channels

Valeri Korjik, Kirill Morozov

Lecture notes in computer science•Jan 1, 2001•14 citations
. The Wire-Tap Channel of Wyner [19] shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a cryptographic scenario of two honest people facing an eavesdropper. Later Cr'epeau and Kilian [9] showed how a BSC may be used to implement Oblivious Transfer in a cryptographic scenario of two possibly dishonest people facing each other. Unfortunately this result is rather impractical as it requires\\Omega (n 11 ) bits to be transmitted through the BSC to accomplish a single OT. The current paper provides efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel. Our protocols respectively require sending O(n) and O(n 3 ) bits through the BSC. These results are based on a technique known as Generalized Privacy Amplification [1] that allow two people to extract secret information from partially compromised data. 1 Introduction The cryptographic power of a no...