Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sungwook | - |
dc.contributor.author | Lee, Hyeonbum | - |
dc.contributor.author | Seo, Jae Hong | - |
dc.date.accessioned | 2023-03-13T07:19:33Z | - |
dc.date.available | 2023-03-13T07:19:33Z | - |
dc.date.created | 2023-03-08 | - |
dc.date.issued | 2022-12 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/182523 | - |
dc.description.abstract | We propose three interactive zero-knowledge arguments for arithmetic circuit of size N in the common random string model, which can be converted to be non-interactive by Fiat-Shamir heuristics in the random oracle model. First argument features O(logN) communication and round complexities and O(N) computational complexity for the verifier. Second argument features O(log N) communication and O(N) computational complexity for the verifier. Third argument features O(log N) communication and O(NlogN) computational complexity for the verifier. Contrary to first and second arguments, the third argument is free of reliance on pairing-friendly elliptic curves. The soundness of three arguments is proven under the standard discrete logarithm and/or the double pairing assumption, which is at least as reliable as the decisional Diffie-Hellman assumption. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Springer Science and Business Media Deutschland GmbH | - |
dc.title | Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Seo, Jae Hong | - |
dc.identifier.doi | 10.1007/978-3-031-22966-4_14 | - |
dc.identifier.scopusid | 2-s2.0-85148020636 | - |
dc.identifier.wosid | 000964575000014 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.13792 LNCS, pp.403 - 433 | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.volume | 13792 LNCS | - |
dc.citation.startPage | 403 | - |
dc.citation.endPage | 433 | - |
dc.type.rims | ART | - |
dc.type.docType | Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | Cryptography | - |
dc.subject.keywordPlus | Computational complexity | - |
dc.subject.keywordPlus | Arithmetic circuit | - |
dc.subject.keywordPlus | Communication complexity | - |
dc.subject.keywordPlus | Discrete logarithms | - |
dc.subject.keywordPlus | Fiat-Shamir | - |
dc.subject.keywordPlus | Random Oracle model | - |
dc.subject.keywordPlus | Random string | - |
dc.subject.keywordPlus | Round complexity | - |
dc.subject.keywordPlus | String models | - |
dc.subject.keywordPlus | Sublinear | - |
dc.subject.keywordPlus | Zero knowledge | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-031-22966-4_14 | - |
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.