publication . Preprint . 2017

Quantum hashing is maximally secure against classical leakage

Huang, Cupjin; Shi, Yaoyun;
Open Access English
  • Published: 04 Jan 2017
Abstract
Comment: 23 pages
Subjects
arXiv: Computer Science::Cryptography and Security
ACM Computing Classification System: TheoryofComputation_MISCELLANEOUS
free text keywords: Quantum Physics
Funded by
NSF| AF: CIF: Small: Theoretical Problems in Quantum Cmputation and Cmmunication
Project
  • Funder: National Science Foundation (NSF)
  • Project Code: 1216729
  • Funding stream: Directorate for Computer & Information Science & Engineering | Division of Computing and Communication Foundations
Download from
25 references, page 1 of 2

[1] F. Ablayev and A. Vasiliev. 11(2):025202, 2013.

[4] C. H. Bennett, G. Brassard, C. Cr´epeau, and U. M. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41(6):1915-1923, 1995.

[5] C. H. Bennett, G. Brassard, and J.-M. Robert. How to reduce your enemys information. In Conference on the Theory and Application of Cryptographic Techniques, pages 468-476. Springer, 1985.

[6] D. Boneh and V. Shoup. A Graduate Course in Applied Cryptography. 2015. Available at https://crypto.stanford.edu/~dabo/cryptobook/draft_0_2.pdf.

[7] E. Brier and M. Joye. Weierstraß elliptic curves and side-channel attacks. In International Workshop on Public Key Cryptography, pages 335-345. Springer, 2002.

[8] H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16):167902, 2001. [OpenAIRE]

[9] Y. Dodis, K. Haralambiev, A. Lo´pez-Alt, and D. Wichs. Efficient public-key cryptography in the presence of key leakage. In International Conference on the Theory and Application of Cryptology and Information Security, pages 613-631. Springer, 2010.

[10] Y. Dodis and D. Wichs. Non-malleable extractors and symmetric key cryptography from weak secrets. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 601-610. ACM, 2009.

[11] D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separations for oneway quantum communication complexity, with applications to cryptography. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 516-525. ACM, 2007. [OpenAIRE]

[12] O. Goldreich, R. Israel, and D. Zuckerman. Another proof that bpp ⊆ ph (and more). In Electronic Colloquium on Computational Complexity. Citeseer, 1997.

[13] M. Joye and J.-J. Quisquater. Hessian elliptic curves and side-channel attacks. In International Workshop on Cryptographic Hardware and Embedded Systems, pages 402-410. Springer, 2001.

[14] R. T. Konig and B. M. Terhal. The bounded-storage model in the presence of a quantum adversary. IEEE Transactions on Information Theory, 54(2):749-762, 2008.

[15] U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3):733-742, 1993.

[16] D. Moshkovitz. Parallel repetition from fortification. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, pages 414-423. IEEE, 2014. [OpenAIRE]

[17] J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM journal on computing, 22(4):838-856, 1993. [OpenAIRE]

25 references, page 1 of 2
Abstract
Comment: 23 pages
Subjects
arXiv: Computer Science::Cryptography and Security
ACM Computing Classification System: TheoryofComputation_MISCELLANEOUS
free text keywords: Quantum Physics
Funded by
NSF| AF: CIF: Small: Theoretical Problems in Quantum Cmputation and Cmmunication
Project
  • Funder: National Science Foundation (NSF)
  • Project Code: 1216729
  • Funding stream: Directorate for Computer & Information Science & Engineering | Division of Computing and Communication Foundations
Download from
25 references, page 1 of 2

[1] F. Ablayev and A. Vasiliev. 11(2):025202, 2013.

[4] C. H. Bennett, G. Brassard, C. Cr´epeau, and U. M. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41(6):1915-1923, 1995.

[5] C. H. Bennett, G. Brassard, and J.-M. Robert. How to reduce your enemys information. In Conference on the Theory and Application of Cryptographic Techniques, pages 468-476. Springer, 1985.

[6] D. Boneh and V. Shoup. A Graduate Course in Applied Cryptography. 2015. Available at https://crypto.stanford.edu/~dabo/cryptobook/draft_0_2.pdf.

[7] E. Brier and M. Joye. Weierstraß elliptic curves and side-channel attacks. In International Workshop on Public Key Cryptography, pages 335-345. Springer, 2002.

[8] H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16):167902, 2001. [OpenAIRE]

[9] Y. Dodis, K. Haralambiev, A. Lo´pez-Alt, and D. Wichs. Efficient public-key cryptography in the presence of key leakage. In International Conference on the Theory and Application of Cryptology and Information Security, pages 613-631. Springer, 2010.

[10] Y. Dodis and D. Wichs. Non-malleable extractors and symmetric key cryptography from weak secrets. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 601-610. ACM, 2009.

[11] D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separations for oneway quantum communication complexity, with applications to cryptography. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 516-525. ACM, 2007. [OpenAIRE]

[12] O. Goldreich, R. Israel, and D. Zuckerman. Another proof that bpp ⊆ ph (and more). In Electronic Colloquium on Computational Complexity. Citeseer, 1997.

[13] M. Joye and J.-J. Quisquater. Hessian elliptic curves and side-channel attacks. In International Workshop on Cryptographic Hardware and Embedded Systems, pages 402-410. Springer, 2001.

[14] R. T. Konig and B. M. Terhal. The bounded-storage model in the presence of a quantum adversary. IEEE Transactions on Information Theory, 54(2):749-762, 2008.

[15] U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3):733-742, 1993.

[16] D. Moshkovitz. Parallel repetition from fortification. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, pages 414-423. IEEE, 2014. [OpenAIRE]

[17] J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM journal on computing, 22(4):838-856, 1993. [OpenAIRE]

25 references, page 1 of 2
Any information missing or wrong?Report an Issue