Efficient verifiable data streaming
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kee Sung | - |
dc.contributor.author | Jeong, Ik Rae | - |
dc.date.accessioned | 2021-09-04T10:12:18Z | - |
dc.date.available | 2021-09-04T10:12:18Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2015-12 | - |
dc.identifier.issn | 1939-0114 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/91790 | - |
dc.description.abstract | In 2012, D. Schroder and H. Schroder introduced verifiable data streaming (VDS) that enables a client to append, search, verify, and update the streamed data efficiently. After storing the data with a server, a client issues a query to receive a proof that the data of the client are still correctly stored. Anyone can check the validity of the proof publicly in VDS. However, the length of a secret of a client, the length of a proof, and the complexity of appending an element in the previous VDS schemes are O(log n), where n is the upper bound on the number of elements to be stored. In this paper, we suggest a more efficient VDS scheme. In our scheme, the length of a secret of a client is only O(1), and the length of a proof and the complexity of appending an element are O(log i), where i(<= n) is the index of an element. We also show that our scheme is secure under any collision-resistant hash functions and unforgeable signature schemes without random oracles. Copyright (C) 2015 John Wiley & Sons, Ltd. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | WILEY-HINDAWI | - |
dc.subject | COMPUTATION | - |
dc.subject | DELEGATION | - |
dc.title | Efficient verifiable data streaming | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jeong, Ik Rae | - |
dc.identifier.doi | 10.1002/sec.1317 | - |
dc.identifier.scopusid | 2-s2.0-84959329572 | - |
dc.identifier.wosid | 000367922500056 | - |
dc.identifier.bibliographicCitation | SECURITY AND COMMUNICATION NETWORKS, v.8, no.18, pp.4013 - 4018 | - |
dc.relation.isPartOf | SECURITY AND COMMUNICATION NETWORKS | - |
dc.citation.title | SECURITY AND COMMUNICATION NETWORKS | - |
dc.citation.volume | 8 | - |
dc.citation.number | 18 | - |
dc.citation.startPage | 4013 | - |
dc.citation.endPage | 4018 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | COMPUTATION | - |
dc.subject.keywordPlus | DELEGATION | - |
dc.subject.keywordAuthor | data streaming | - |
dc.subject.keywordAuthor | public verifiability | - |
dc.subject.keywordAuthor | cloud computing | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
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.