Filters








7 Hits in 1.6 sec

Information Dispersal with Provable Retrievability for Rollups [article]

Kamilla Nazirkhanova, Joachim Neu, David Tse
2021 arXiv   pre-print
We formalize the problem and design a storage- and communication-efficient protocol using linear erasure-correcting codes and homomorphic vector commitments.  ...  Compared to Data Availability Oracles, under no circumstance do we fall back to returning empty blocks.  ...  First, how to ensure that the state is only updated in accordance with the application logic.  ... 
arXiv:2111.12323v2 fatcat:kg3afrukb5ghrcohza75ql2vhy

UC Updatable Databases and Applications [chapter]

Aditya Damodaran, Alfredo Rial
2020 Lecture Notes in Computer Science  
The updater maps the database to a vector and commits to the database. This commitment can be updated efficiently at any time without needing a revocation mechanism.  ...  FUD allows us to improve modularity in protocol design by separating those tasks. We show how to use FUD as building block of a hybrid protocol along with other functionalities.  ...  In succinct non-interactive arguments of knowledge [20] , verification cost is independent of N , but the cost for the prover is still linear in N .  ... 
doi:10.1007/978-3-030-51938-4_4 fatcat:a6o2x2bdtfa7vghr7zaqvcfytq

A Spline Dimensional Decomposition for Uncertainty Quantification in High Dimensions [article]

Sharif Rahman, Ramin Jahanbin
2021 arXiv   pre-print
The decomposition creates an hierarchical expansion for an output random variable of interest with respect to measure-consistent orthonormalized basis splines (B-splines) in independent input random variables  ...  Exploiting the modulus of smoothness, the SDD approximation is shown to converge in mean-square to the correct limit.  ...  The authors thank the anonymous reviewers and the associate editor for providing suggestions to improve the previous version of the paper.  ... 
arXiv:2111.12870v1 fatcat:h54hkdk775chxfpet7tfo5fmnq

Verifying computations with streaming interactive proofs

Graham Cormode, Justin Thaler, Ke Yi
2011 Proceedings of the VLDB Endowment  
We first observe that some theoretical results can be modified to work with streaming verifiers, showing that there are efficient protocols for problems in the complexity classes NP and NC.  ...  verifying computations which are streaming in nature: the verifier (data owner) needs only logarithmic space and a single pass over the input, and after observing the input follows a simple protocol with  ...  RESULTS DUE TO PRIOR WORK  ... 
doi:10.14778/2047485.2047488 fatcat:qmy2eytuv5djti3hresuprmyue

Verifying Computations with Streaming Interactive Proofs [article]

Graham Cormode, Justin Thaler, Ke Yi
2011 arXiv   pre-print
We first observe that some theoretical results can be modified to work with streaming verifiers, showing that there are efficient protocols for problems in the complexity classes NP and NC.  ...  verifying computations which are streaming in nature: the verifier (data owner) needs only logarithmic space and a single pass over the input, and after observing the input follows a simple protocol with  ...  RESULTS DUE TO PRIOR WORK  ... 
arXiv:1109.6882v1 fatcat:426d3pzgvvhcbc5tdwawdtvdoe

Decision Rule Approximations for Dynamic Optimization under Uncertainty

Phebe Theofano Vayanos, Berc Rustem, Daniel Kuhn
2013
This assumption nevertheless fails to hold in real-world energy markets, where the option admits a whole interval of prices consistent with those of traded instruments.  ...  Dynamic decision problems affected by uncertain data are notoriously hard to solve due to the presence of adaptive decision variables which must be modeled as functions or decision rules of some (or all  ...  Similar arguments show that AW, W +∞ and AW +∞ are always feasible as well.The arguments from the previous paragraph extend to problem H .  ... 
doi:10.25560/10972 fatcat:zaiv4bwivvgq5cbh4zt7jz655u

Contributions to robust combinatorial optimization with budgeted uncertainty Thèse d'habilitation à diriger des recherches présentée par Contributions to robust combinatorial optimization with budgeted uncertainty

Michael Poss, Michael Poss
unpublished
Introduction Scheduling is a very wide topic in combinatorial optimization with applications ranging from production and manufacturing systems to transportation and logistics systems.  ...  Otherwise, by the coefficients to A σ j in the two arguments of the maximum function,c(σ) increases by at least one unit.  ...  Dualizing the assignment formulation for 1||U Γ p | j w j C j , one ends up with a problem combining 1|| j w j T j and 1|| j w j C j .  ... 
fatcat:vq6cb3ykozduxdqfjusrbntf7m