Efficient verifiable data streaming
- Authors
- Kim, Kee Sung; Jeong, Ik Rae
- Issue Date
- 12월-2015
- Publisher
- WILEY-HINDAWI
- Keywords
- data streaming; public verifiability; cloud computing
- Citation
- SECURITY AND COMMUNICATION NETWORKS, v.8, no.18, pp.4013 - 4018
- Indexed
- SCIE
SCOPUS
- Journal Title
- SECURITY AND COMMUNICATION NETWORKS
- Volume
- 8
- Number
- 18
- Start Page
- 4013
- End Page
- 4018
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/91790
- DOI
- 10.1002/sec.1317
- ISSN
- 1939-0114
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.