[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.7858/eamj.2022.007

ZERO-KNOWLEDGE PROOFS FROM SPLWE-BASED COMMITMENTS

Publication Information

East Asian mathematical journal / v.38, no.1, 2022 , pp. 85-94 More about this Journal

Abstract

Recently, an LWE-based commitment scheme is proposed. Their construction is statistically hiding as well as computationally binding. On the other hand, the construction of related zero-knowledge protocols is left as an open problem. In this paper, we present zero-knowledge protocols with hardness based on the LWE problem. we show how to instantiate efficient zero-knowledge protocols that can be used to prove linear and sum relations among these commitments. In addition, we show how the variant of LWE, spLWE problem, can be used to instantiate efficient zero-knowledge protocols.

Keywords

Zero-knowledge proof; LWE; spLWE; Commitment; Linear relation; Sum relation;

Citations & Related Records

Reference

1	F. Benhamouda, J. Camenisch, S. Krenn, V. Lyubashevsky, G. Neven, Better zero-knowledge proofs for lattice encryption and their application to group signatures, International Conference on the Theory and Application of Cryptology and Information Security, Springer, Berlin, Heidelberg, (2014), 551-572.
2	V. Lyubashevsky, Lattice signatures without trapdoors, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, Heidelberg, (2012), 738-755.
3	X. Xie, R. Xue, M. Wang, Zero knowledge proofs from Ring-LWE, International Conference on Cryptology and Network Security, Springer, Cham, (2013), 57-73.
4	O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (2005), 84-93.
5	C. P. Schnorr, Efficient signature generation by smart cards, Journal of cryptology, 4(3), (1991), 161-174. DOI
6	F. Benhamouda, S. Krenn, V. Lyubashevsky, K. Pietrzak, Efficient zero-knowledge proofs for commitments from learning with errors over rings, European symposium on research in computer security, Springer, Cham, (2015), 305-325.
7	M. Ajtai, Generating hard instances of lattice problems, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, (1996), 99-108.
8	W. Banaszczyk, Inequalities for convex bodies and polar reciprocal lattices in ℝⁿ, Discrete & Computational Geometry, 13(2), (1995), 217-231. DOI
9	S. Bai, S. Galbraith, An improved compression technique for signatures based on learning with errors, RSA Conference, Springer, Cham, (2014), 28-47.
10	J. Bos, C. Costello, L. Ducas, I. Mironov, M. Naehrig, V. Nikolaenko, D. Stebila, Frodo: Take off the ring! practical, quantum-secure key exchange from LWE, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (2016), 1006-1018.
11	A. Jain, S. Krenn, K. Pietrzak, A. Tentes, Commitments and efficient zero-knowledge proofs from learning parity with noise, International Conference on the Theory and Application of Cryptology and Information Security, Springer, Berlin, Heidelberg, (2012), 663-680.
12	J. Kim, A Post-Quantum Commitment Scheme based on spLWE, IJCSNS International Journal of Computer Science and Network Security, 20(12), (2020), 265-271.
13	G. Asharov, A. Jain, A. Lopez-Alt, E. Tromer, V. Vaikuntanathan, D. Wichs, Multiparty computation with low communication, computation and interaction via threshold FHE, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, Heidelberg, (2012), 483-501.
14	R. Lindner, C. Peikert, Better key sizes (and attacks) for LWE-based encryption, RSA Conference, Springer, Berlin, Heidelberg, (2011), 99-108.
15	M. Blum, Coin flipping by telephone a protocol for solving impossible problems, ACM SIGACT News, 15(1), (1983), 23-27. DOI