Nearly Optimal Verifiable Data Streaming
From MaRDI portal
Publication:2798786
DOI10.1007/978-3-662-49384-7_16zbMath1388.94065OpenAlexW2293985183MaRDI QIDQ2798786
Giuseppe Ateniese, Mark Simkin, Dominique Schröder, Stefan Nürnberger, Dario Fiore, Johannes Krupp
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_16
Related Items (5)
New unbounded verifiable data streaming for batch query with almost optimal overhead ⋮ PointProofs, revisited ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Non-malleable vector commitments via local equivocability ⋮ Non-malleable vector commitments via local equivocability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information hiding in probabilistic concurrent systems
- Temporal Specifications with Accumulative Values
- Maximizing the Conditional Expected Reward for Reaching the Goal
- Understanding Probabilistic Programs
- An Analysis of Stochastic Shortest Path Problems
- Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
- Synthesizing Probabilistic Invariants via Doob’s Decomposition
- Weight monitoring with linear temporal logic
- Variations on the Stochastic Shortest Path Problem
- Markov Decision Processes with Multiple Long-run Average Objectives
- Probabilistic Model Checking for Energy-Utility Analysis
- A Hybrid Algorithm for LTL Games
- Decisive Markov Chains
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
- Compositional Methods for Information-Hiding
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Conditioning in probabilistic programming
This page was built for publication: Nearly Optimal Verifiable Data Streaming
