{"title": "Streaming Authenticated Data Structures.", "fields": ["gas meter prover", "verifiable secret sharing", "logarithm", "correctness", "delegate"], "abstract": "We consider the problem of streaming verifiable computation, where both a verifier and a prover observe a stream of n elements x 1,x 2,\u2026,x n and the verifier can later delegate some computation over the stream to the prover. The prover must return the output of the computation, along with a cryptographic proof to be used for verifying the correctness of the output. Due to the nature of the streaming setting, the verifier can only keep small local state (e.g., logarithmic) which must be updatable in a streaming manner and with no interaction with the prover. Such constraints make the problem particularly challenging and rule out applying existing verifiable computation schemes.", "citation": "Citations (27)", "year": "2013", "departments": ["University of California, Berkeley", "University of Maryland, College Park", "Brown University", "Hong Kong University of Science and Technology"], "conf": "eurocrypt", "authors": ["<NAME>.....http://dblp.org/pers/hd/p/Papamanthou:Charalampos", "<NAME>.....http://dblp.org/pers/hd/s/Shi:Elaine", "<NAME>.....http://dblp.org/pers/hd/t/Tamassia:Roberto", "<NAME>i.....http://dblp.org/pers/hd/y/Yi:Ke"], "pages": 18}