Verifiable data streaming

Conference contribution
(Conference Contribution)

Publication Details

Author(s): Schröder D, Schröder H
Publication year: 2012
Pages range: 953-964
ISBN: 9781450316507


In a verifiable data streaming protocol, the client streams a long string to the server who stores it in its database. The stream is verifiable in the sense that the server can neither change the order of the elements nor manipulate them. The client may also retrieve data from the database and update them. The content of the database is publicly verifiable such that any party in possession of some value s and a proof π can check that s is indeed in the database. We introduce the notion of verifiable data streaming and present an efficient instantiation that supports an exponential number of values based on general assumptions. Our main technique is an authentication tree in which the leaves are not fixed in advanced such that the user, knowing some trapdoor, can authenticate a new element on demand without pre- or re-computing all other leaves. We call this data structure chameleon authentication tree (CAT). We instantiate our scheme with primitives that are secure under the discrete logarithm assumption. The algebraic properties of this assumption allow us to obtain a very efficient verification algorithm. As a second application of CATs, we present a new transformation from any one-time to many-time signature scheme that is more efficient than previously known solutions. Copyright © 2012 ACM.

FAU Authors / FAU Editors

Schröder, Dominique Prof. Dr.
Lehrstuhl für Informatik 13 (Angewandte Kryptographie)

External institutions with authors

Technische Universität Darmstadt

How to cite

Schröder, D., & Schröder, H. (2012). Verifiable data streaming. (pp. 953-964). Raleigh, NC.

Schröder, Dominique, and Heike Schröder. "Verifiable data streaming." Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, Raleigh, NC 2012. 953-964.


Last updated on 2018-11-12 at 20:50

Share link