Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 오현옥 | - |
dc.date.accessioned | 2022-04-08T08:09:46Z | - |
dc.date.available | 2022-04-08T08:09:46Z | - |
dc.date.issued | 2020-08 | - |
dc.identifier.citation | IEEE ACCESS, v. 8, page. 156569-156581 | en_US |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/9179754 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/169801 | - |
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. | en_US |
dc.description.sponsorship | This work was supported by the Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT Korea under Grant 2017-0-00661 and Grant 2016-6-00599. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | en_US |
dc.subject | Pairing-based zk-SNARK | en_US |
dc.subject | simulation-extractability | en_US |
dc.subject | quadratic arithmetic program | en_US |
dc.subject | square arithmetic program | en_US |
dc.title | Simulation-Extractable zk-SNARK With a Single Verification | en_US |
dc.type | Article | en_US |
dc.relation.volume | 8 | - |
dc.identifier.doi | 10.1109/ACCESS.2020.3019980 | - |
dc.relation.page | 156569-156581 | - |
dc.relation.journal | IEEE ACCESS | - |
dc.contributor.googleauthor | Kim, Jihye | - |
dc.contributor.googleauthor | Lee, Jiwon | - |
dc.contributor.googleauthor | Oh, Hyunok | - |
dc.relation.code | 2020045465 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF INFORMATION SYSTEMS | - |
dc.identifier.pid | hoh | - |
dc.identifier.researcherID | AAY-6953-2020 | - |
dc.identifier.orcid | https://orcid.org/0000-0002-9044-7441 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.