Efficient verifiable data streaming

Kee Sung Kim, ik rae Jeong

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume8
Issue number18
DOIs
Publication statusPublished - 2015 Dec 1

Fingerprint

Hash functions
Servers

Keywords

  • Cloud computing
  • Data streaming
  • Public verifiability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Efficient verifiable data streaming. / Kim, Kee Sung; Jeong, ik rae.

In: Security and Communication Networks, Vol. 8, No. 18, 01.12.2015, p. 4013-4018.

Research output: Contribution to journalArticle

Kim, Kee Sung ; Jeong, ik rae. / Efficient verifiable data streaming. In: Security and Communication Networks. 2015 ; Vol. 8, No. 18. pp. 4013-4018.
@article{6b255f1546514a8389976dba6febef53,
title = "Efficient verifiable data streaming",
abstract = "In 2012, D. Schr {\"o}der and H. Schr {\"o}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.",
keywords = "Cloud computing, Data streaming, Public verifiability",
author = "Kim, {Kee Sung} and Jeong, {ik rae}",
year = "2015",
month = "12",
day = "1",
doi = "10.1002/sec.1317",
language = "English",
volume = "8",
pages = "4013--4018",
journal = "Security and Communication Networks",
issn = "1939-0122",
publisher = "John Wiley and Sons Inc.",
number = "18",

}

TY - JOUR

T1 - Efficient verifiable data streaming

AU - Kim, Kee Sung

AU - Jeong, ik rae

PY - 2015/12/1

Y1 - 2015/12/1

N2 - 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.

AB - 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.

KW - Cloud computing

KW - Data streaming

KW - Public verifiability

UR - http://www.scopus.com/inward/record.url?scp=84959329572&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959329572&partnerID=8YFLogxK

U2 - 10.1002/sec.1317

DO - 10.1002/sec.1317

M3 - Article

AN - SCOPUS:84959329572

VL - 8

SP - 4013

EP - 4018

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0122

IS - 18

ER -