Efficient verifiable data streaming

Kee Sung Kim, Ik Rae Jeong

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


In 2012, D. Schr öder and H. Schr öder 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(logn), 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(logi), 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.

Original languageEnglish
Pages (from-to)4013-4018
Number of pages6
JournalSecurity and Communication Networks
Issue number18
Publication statusPublished - 2015 Dec 1

Bibliographical note

Publisher Copyright:
© 2015 John Wiley & Sons, Ltd.


  • Cloud computing
  • Data streaming
  • Public verifiability

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications


Dive into the research topics of 'Efficient verifiable data streaming'. Together they form a unique fingerprint.

Cite this