Font Size: a A A

Research On Zero-knowledge Databases For NP

Posted on:2022-09-24Degree:MasterType:Thesis
Country:ChinaCandidate:K ShiFull Text:PDF
GTID:2518306482487884Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
The database verification scenario is a classic data service scene,which completes such tasks as information confirmation and qualification review by verifying the private data of the users in the database.With great convenience,it is replacing the traditional verification scenario characterized by printing storage and human review.Yet,this scenario is accompanied by frequent privacy leakage resulted from third-party database storage.To solve this issue,the researchers come up with a series of privacy protection technologies,enabling zero-knowledge proof for certain types of encrypted statements(such as member statements and scope statements).Yet no technology that supports universal statement proof.This paper comes up with expanded concepts based on the zero-knowledge database technology to fill up the gap on privacy protection.For this purpose,this paper conducts the following basic research:(1)Come up with the concept zero-knowledge database for NP(including its basic structures,applications and formalized definition)based on the needs in the universal database verification scenarios.In essence,the zero-knowledge database for NP is a special type of the zero-knowledge database.It supports the zero-knowledge proof of universal statements with higher practical and safety requirements.(2)Propose the first zero-knowledge database scheme for NP based on the specific non-interactive zero-knowledge proof scheme and its implementations idea,and expands the scheme to support data update and validation update.(3)Bring about two types of universal structural frameworks based on the cryptographic primitives like non-interactive zero-knowledge proof and fully homomorphic commitment,providing multiple choices for the implementation of the scheme,and lowering the threshold to structure/prove similar schemes.This paper comes up with the privacy protection scheme and universal structural framework for the universal database verification scenario,offering nature analysis and efficiency analysis.The privacy protection issue in this scenario is partly solved,functioning as a reference to the efficient implementation of similar schemes in future.
Keywords/Search Tags:Zero-knowledge databases, Database verification scenario, Zero-knowledge proof, Fully homomorphic commitment, Privacy protection
PDF Full Text Request
Related items