Cryptography and Coding

DOI10.1007/B93924MaRDI QIDQ5428150zbMATH OpenOpenAlexFDO

Authors Andreas Winter, Anderson Nascimento, Hideki Imai

Publication date 28 November 2007

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

Full work available at URL https://doi.org/10.1007/b93924

Mathematics Subject Classification ID

Quantum computation (81P68) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Cryptography (94A60)

Recommendations

• On oblivious transfer capacity
• Secure classical bit commitment using fixed capacity communication channels
• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• Topics in Cryptology – CT-RSA 2004
• On the efficiency of bit commitment reductions

Cited in

(10)

• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Cryptography from one-way communication: on completeness of finite channels
• scientific article; zbMATH DE number 3147955 (Why is no real title available?)
• Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
• Oblivious Transfer Is Symmetric
• On oblivious transfer capacity
• Transmission of a Bit Over a Discrete Poisson Channel With Memory
• On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• Iterative minimization algorithm on a mixture family

This page was built for publication: Cryptography and Coding

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