Citation: | LIU Yipeng, GUO Jiansheng, CUI Jingyi, “Non-malleable Extractor in the Presence of Classical or Quantum Side Information,” Chinese Journal of Electronics, vol. 28, no. 5, pp. 938-943, 2019, doi: 10.1049/cje.2019.06.004 |
C.H. Bennett, G. Brassard and J.-M. Robert, "Privacy amplification by public discussion", SIAM Journal on Computing, Vol.17, No.2, pp.210-229, 2006.
|
C. H. Bennett, G. Brassard, C. Crepeau, et al., "Generalized privacy amplification", IEEE Transaction on Information Theory, Vol.41, No.6, pp.1915-1923, 1995.
|
N. Nisan and D. Zuckerman, "Randomness is linear in space", Journal of Computer and System Sciences, Vol. 52, No.1, pp.43-52, 1996.
|
U.M. Maurer, "Conditionally-perfect secrecy and a provablysecure randomized cipher", Journal of Cryptology, Vol.5, No.1, pp.53-66, 1992.
|
Y. Dodis and D. Wichs, "Non-malleable extractors and symmetric key cryptography from weak secrets", Proc. of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, pp. 601-610, 2009.
|
D. Aggarwal, K.M. Chung, H.H. Lin, et al., "A QuantumProof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries", available at https://arxiv.org/abs/1710.00557,2018-01-18.
|
U. Maurer and S. Wolf, "Privacy amplification secure against active adversaries", Proc. of CRYPTO'97, Santa Barbara, California, USA, pp.307-321, 1997.
|
R. Renner and S. Wolf, "Unconditional authenticity and privacy from an arbitrarily weak secret", Proc. of CRYPTO'03, Santa Barbara, California, USA, pp.78-95, 2003.
|
B. Kanukurthi and L. Reyzin, "Key agreement from close secrets over unsecured channels", Proc. of EUROCRYPT 2009, Cologne, Germany, pp.206-223, 2009.
|
N. Chandran, B. Kanukurthi, R. Ostrovsky, et al., "Privacy amplification with asymptotically optimal entropy loss", Proc. of the 42nd Annual ACM Symposium on Theory of Computing, Cambridge, Massachusetts, USA, pp. 785-794, 2010.
|
Y. Dodis, X. Li, T.D. Wooley, et al., "Privacy amplification and non-malleable extractors via character sums", SIAM Journal on Computing, Vol.43, No.2, pp.800-830, 2014.
|
G. Cohen, R. Raz and G. Segev, "Non-malleable extractors with short seeds and applications to privacy amplification", SIAM Journal on Computing, Vol.43, No.2, pp.450-476, 2014.
|
X. Li, "Design extractors, non-malleable condensers and privacy amplification", Proc. of the 44th Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp.837-854, 2012.
|
X. Li, "Non-malleable extractors, two-source extractors and privacy amplification", Proc. of the 53rd Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA, pp. 688-697, 2012.
|
X. Li, "Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification", Proc. of the 12th Theory of Cryptography Conference,Warsaw, Poland, pp.502-531, 2015.
|
D. Aggarwal, Y. Dodis, Z. Jafargholi, et al., "Amplifying Privacy in Privacy Amplification", Proc. of CRYPTO 2014, Santa Barbara, CA, USA, pp. 183-198, 2014.
|
R.T. Konig and B.M. Terhal, "The bounded-storage model in the presence of a quantum adversary", IEEE Transactions on Information Theory, Vol.54, No.2, pp.749-762, 2008.
|
M. Berta, O. Fawzi and V.B. Scholz, "Quantum-proof randomness extractors via operator space theory", available at https://arxiv.org/abs/1409.3563,2018-01-18.
|
R. Renner and R. Konig, "Universally composable privacy amplification against quantum adversaries", Proc. of Theory of Cryptography, Cambridge, MA, USA, pp.407-425, 2005.
|
A. De, C. Portmann, T. Vidick, et al., "Trevisan's extractor in the presence of quantum side information", SIAM Journal on Computing, Vol.41, No.4, pp.915-940, 2012.
|
M. Tomamichel, C. Schaffner, A. Smith, et al., "Leftover hashing against quantum side information", IEEE Transactions on Information Theory, Vol.57, No.8, pp.5524-5535, 2011.
|
M. Hayashi and T. Tsurumaru, "More efficient privacy amplification with less random seeds", IEEE Transactions on Information Theory, Vol.62, No.4, pp.2213-2232, 2016.
|
R. Renner, "Security of Quantum Key Distribution", Ph.D. thesis, Swiss Federal Institute of Technology Zurich, Switzerland, 2005.
|
R. Konig and R. Renner, "Sampling of min-entropy relative to quantum knowledge", IEEE Transactions on Information Theory, Vol.57, No.7, pp.4760-4787, 2011.
|
N. Nisan and D. Zuckerman, "Randomness is Linear in Space", Journal of Computer and System Sciences, Vol. 52, No.1, pp. 43-52, 1996.
|