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

neural information processing systems

Privacy amplification by random allocation

Moshe Shenfeld, Vitaly Feldman

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.52202/085713-3215

Related papers

Noise Tolerance of the BB84 Protocol with Random Privacy Amplification

隆太郎 松本, Ryutaroh Matsumoto

•Sep 1, 2005•0 citations

Noise tolerance of the BB84 protocol with random privacy amplification

峻 渡辺, Shun N. Watanabe, 隆太郎 松本 +3 more

•Dec 1, 2006•0 citations

Noise Tolerance of the BB84 Protocol with Random Privacy Amplification

友彦 植松, TOMOHIKO UYEMATSU

•Sep 1, 2005•0 citations

Amplifying Privacy in Privacy Amplification

Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi +2 more

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

Privacy amplification scheme based on composite coding

Wei Li, Shengmei Zhao

Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.

arXiv:2109.07139•Sep 15, 2021•0 citations

Privacy Amplification with Social Networks

Shishir Nagaraja

Lecture notes in computer science•Jan 1, 2010•1 citation
Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.