Zero-knowledge proof of generalized compact knapsacks (or a novel identification/signature scheme)

Authors:
Bo Qin;Qianhong Wu;Willy Susilo;Yi Mu;Yumin Wang
Affiliations:
National Key Laboratory of Integrated Service Networks, Xidian University, Xi’an City, P.R. China;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;National Key Laboratory of Integrated Service Networks, Xidian University, Xi’an City, P.R. China
Venue:
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Year:
2006

Citing 13
Cited 0

Solving low-density subset sum problems

Journal of the ACM (JACM)
How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Quantum Public-Key Cryptosystems

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Designing Identification Schemes with Keys of Short Size

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
New lattice based cryptographic constructions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the (In)security of the Fiat-Shamir Paradigm

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A new identification scheme based on the perceptrons problem

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Superimposing voronoi complexes for shape deformation

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

At FOCS 2002, a new generalized compact Knapsacks problem is introduced. It is shown that solving the generalized compact Knapsack problem on the average is at least as hard as the worst-case instance of various approximation problems over cyclic lattices. It is left as an open problem to construct a zero-knowledge proof of generalized compact Knapsack problem. In this paper, by investigating a new notion of one-way ensemble pair, we propose a generic construction of identification and achieve a signature with the Fiat-Shamir transformation. Following our generic construction, we implement a concrete scheme based on the random generalized compact Knapsack problem. Our scheme also implies the first efficient zero-knowledge proof of the generalized compact Knapsacks problem and results in a positive solution to the open problem at FOCS 2002.