Full Text:
<2164>
Summary: 
<1208>
CLC number: TP309.7
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 2017-09-24
Cited: 0
Clicked: 6837
Quantum security analysis of a lattice-based oblivious transfer protocol
| ||||||||||||||
Mo-meng Liu, Juliane Krmer, Yu-pu Hu, Johannes Buchmann. Quantum security analysis of a lattice-based oblivious transfer protocol[J]. Frontiers of Information Technology & Electronic Engineering, 2017, 18(9): 1348-1369.
@article{title="Quantum security analysis of a lattice-based oblivious transfer protocol",
author="Mo-meng Liu, Juliane Krmer, Yu-pu Hu, Johannes Buchmann",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="18",
number="9",
pages="1348-1369",
year="2017",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.1700039"
}
%0 Journal Article
%T Quantum security analysis of a lattice-based oblivious transfer protocol
%A Mo-meng Liu
%A Juliane Krmer
%A Yu-pu Hu
%A Johannes Buchmann
%J Frontiers of Information Technology & Electronic Engineering
%V 18
%N 9
%P 1348-1369
%@ 2095-9184
%D 2017
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.1700039
TY - JOUR
T1 - Quantum security analysis of a lattice-based oblivious transfer protocol
A1 - Mo-meng Liu
A1 - Juliane Krmer
A1 - Yu-pu Hu
A1 - Johannes Buchmann
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 18
IS - 9
SP - 1348
EP - 1369
%@ 2095-9184
Y1 - 2017
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.1700039
Abstract: Because of the concise functionality of oblivious transfer (OT) protocols, they have been widely used as building blocks in secure multiparty computation and high-level protocols. The security of OT protocols built upon classical number theoretic problems, such as the discrete logarithm and factoring, however, is threatened as a result of the huge progress in quantum computing. Therefore, post-quantum cryptography is needed for protocols based on classical problems, and several proposals for post-quantum OT protocols exist. However, most post-quantum cryptosystems present their security proof only in the context of classical adversaries, not in the quantum setting. In this paper, we close this gap and prove the security of the lattice-based OT protocol proposed by Peikert et al. (CRYPTO, 2008), which is universally composably secure under the assumption of learning with errors hardness, in the quantum setting. We apply three general quantum security analysis frameworks. First, we apply the quantum lifting theorem proposed by Unruh (EUROCRYPT, 2010) to prove that the security of the lattice-based OT protocol can be lifted into the quantum world. Then, we apply two more security analysis frameworks specified for post-quantum cryptographic primitives, i.e., simple hybrid arguments (CRYPTO, 2011) and game-preserving reduction (PQCrypto, 2014).
[1]Bernstein, D.J., Buchamann, J., Dahmen, E., 2009. Post-Quantum Cryptography. Springer, Berlin.
[2]Canetti, R., 2001. Universally composable security: a new paradigm for cryptographic protocols. Proc. 42nd IEEE Symp. on Foundations of Computer Science, p.136-145.
[3]Damgård, I., Funder, J., Nielsen, J.B., et al., 2014. Super-position attacks on cryptographic protocols. LNCS, 8317:142-161.
[4]Even, S., Goldreich, O., Lempel, A., 1985. A randomized protocol for signing contracts. Commun. ACM, 28(6):637-647.
[5]Fehr, S., Katz, J., Song, F., et al., 2013. Feasibility and completeness of cryptographic tasks in the quantum world. LNCS, 7785:281-296.
[6]Gentry, C., Peikert, C., Vaikuntanathan, V., 2008. Trapdoors for hard lattices and new cryptographic constructions. Proc. 40th Annual ACM Symp. on Theory of Computing, p.197-206.
[7]Gilboa, N., 1999. Two party RSA key generation. LNCS, 1666:116-129.
[8]Hallgren, S., Smith, A., Song, F., 2011. Classical cryptographic protocols in a quantum world. LNCS, 6841:411-428.
[9]Hallgren, S., Smith, A., Song, F., 2015. Classical cryptographic protocols in a quantum world. Cryptology ePrint Archive, 2015/687. http://eprint.iacr.org/2015/687
[10]Ishai, Y., Kilian, J., Nissim, K., et al., 2003. Extending oblivious transfers efficiently. LNCS, 2729:145-161.
[11]Lai, R.W.F., Cheung, H.K.F., Chow, S.S.M., 2014. Trapdoors for ideal lattices with applications. LNCS, textbf8957:239-256.
[12]Lyubashevsky, V., Peikert, C., Regev, O., 2013. On ideal lattices and learning with errors over rings. J. ACM, 60(6):43.
[13]Micciancio, D., Regev, O., 2009. Lattice-based cryptography. phIn: Bernstein, D.J., Buchmann, J., Dahmen, E. (Eds.), Post-Quantum Cryptography. Springer, Berlin, p.147-191.
[14]Nielsen, M.A., Chuang, I.L., 2010. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge.
[15]Peikert, C., 2009. Some recent progress in lattice-based cryptography. LNCS, 5444:72.
[16]Peikert, C., Vaikuntanathan, V., Waters, B., 2008. A framework for efficient and composable oblivious transfer. LNCS, 5157:554-571.
[17]Rabin, M.O., 1981. How to Exchange Secrets with Oblivious Transfer. Technical Report No. TR-81, Aiken Computation Lab, Harvard University, Cambridge, MA. http://eprint.iacr.org/2005/187
[18]Regev, O., 2005. On lattices, learning with errors, random linear codes, and cryptography. Proc. 37th Annual ACM Symp. on Theory of Computing, p.84-93.
[19]Sendrier, N., 2011. Code-based cryptography. In: van Tilborg, H.C.A., Jajodia, S. (Eds.), Encyclopedia of Cryptography and Security. Springer, New York, p.215-
[20]216.
[21]Song, F., 2014. A note on quantum security for post-quantum cryptography. LNCS, 8772:246-265.
[22]Unruh, D., 2010. Universally composable quantum multi-party computation. LNCS, 6110:486-505.
[23]Unruh, D., 2012. Quantum proofs of knowledge. LNCS, 7237:135-152.
[24]Watrous, J., 2009. Zero-knowledge against quantum attacks. SIAM J. Comput., 39(1):25-58.
[25]Zhandry, M., 2012. How to construct quantum random functions. IEEE 53rd Annual Symp. on Foundations of Computer Science, p.679-687.
ORCID: 
Open peer comments: Debate/Discuss/Question/Opinion
<1>