Simulation-Extractable zk-SNARK With a Single Verification
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jihye | - |
dc.contributor.author | Lee, Jiwon | - |
dc.contributor.author | Oh, Hyunok | - |
dc.date.accessioned | 2021-08-03T02:54:56Z | - |
dc.date.available | 2021-08-03T02:54:56Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2020-08 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/32760 | - |
dc.description.abstract | Among the zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARK), the simulation-extractable zk-SNARK (SE-SNARK) introduces a security notion of non-malleability. The existing pairing-based zk-SNARKs designed from linear encoding are known to be vulnerable to algebraic manipulation of the proof. The latest SE-SNARKs check the proof consistency by increasing the proof size and the verification cost. In particular, the number of pairings increases almost doubles due to further verification. In this article, we propose two novel SE-SNARK constructions with a single verification. The consistency check is subsumed in a single verification through employing a hash function. The proof size and verification time of the proposed SE-SNARK schemes are minimal in that it is the same as the state-of-the-art zk-SNARK without non-malleability. The proof in our SE-SNARK constructions comprises only three group elements (type III) in the QAP-based scheme and two group elements (type I) in the SAP-based scheme. The verification time in both requires only 3 pairings. The soundness of the proposed schemes is proven under the hash-algebraic knowledge (HAK) assumption and the (linear) collision-resistant hash assumption. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Simulation-Extractable zk-SNARK With a Single Verification | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Oh, Hyunok | - |
dc.identifier.doi | 10.1109/ACCESS.2020.3019980 | - |
dc.identifier.scopusid | 2-s2.0-85091220524 | - |
dc.identifier.wosid | 000568250300001 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.8, pp.156569 - 156581 | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 8 | - |
dc.citation.startPage | 156569 | - |
dc.citation.endPage | 156581 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering | - |
dc.relation.journalWebOfScienceCategory | Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | Hash functions | - |
dc.subject.keywordPlus | Algebra | - |
dc.subject.keywordPlus | Algebraic manipulations | - |
dc.subject.keywordPlus | Consistency checks | - |
dc.subject.keywordPlus | Linear encoding | - |
dc.subject.keywordPlus | Non-malleability | - |
dc.subject.keywordPlus | Security notion | - |
dc.subject.keywordPlus | State of the art | - |
dc.subject.keywordPlus | Zero knowledge | - |
dc.subject.keywordAuthor | Protocols | - |
dc.subject.keywordAuthor | Encoding | - |
dc.subject.keywordAuthor | Mathematical model | - |
dc.subject.keywordAuthor | Logic gates | - |
dc.subject.keywordAuthor | Cryptography | - |
dc.subject.keywordAuthor | Pairing-based zk-SNARK | - |
dc.subject.keywordAuthor | simulation-extractability | - |
dc.subject.keywordAuthor | quadratic arithmetic program | - |
dc.subject.keywordAuthor | square arithmetic program | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9179754 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.