Theory of Cryptography
978-3-642-36593-5
978-3-642-36594-2
valid signature
cloud setting
2022-01-01T19:17
crucial performance properties
server
succinct signature σ
performance properties
less time
result v
signatures
en
technique
polynomial evaluation
oracle model
public key
Signatures of Correct Computation
construction
SCC construction
PVC model
function f
results
correct outcome
answers
security
PVC scheme
signature Σ
222-242
update
multivariate polynomials
outcomes
Publicly Verifiable Computation
polynomials
computation
new model
correctness
function
function’s public key
https://scigraph.springernature.com/explorer/license/
work
independent work
SCC scheme
correct computation
coefficient
scheme
chapter
number
true
model
untrusted server
clients
point A.
https://doi.org/10.1007/978-3-642-36594-2_13
expressive manipulations
source
random oracle model
2013
computation results
chapters
setting
manipulation
evaluation
A.
We introduce Signatures of Correct Computation (SCC), a new model for verifying dynamic computations in cloud settings. In the SCC model, a trusted source outsources a function f to an untrusted server, along with a public key for that function (to be used during verification). The server can then produce a succinct signature σ vouching for the correctness of the computation of f, i.e., that some result v is indeed the correct outcome of the function f evaluated on some point a. There are two crucial performance properties that we want to guarantee in an SCC construction: (1) verifying the signature should take asymptotically less time than evaluating the function f; and (2) the public key should be efficiently updated whenever the function changes.We construct SCC schemes (satisfying the above two properties) supporting expressive manipulations over multivariate polynomials, such as polynomial evaluation and differentiation. Our constructions are adaptively secure in the random oracle model and achieve optimal updates, i.e., the function’s public key can be updated in time proportional to the number of updated coefficients, without performing a linear-time computation (in the size of the polynomial).We also show that signatures of correct computation imply Publicly Verifiable Computation (PVC), a model recently introduced in several concurrent and independent works. Roughly speaking, in the SCC model, any client can verify the signature σ and be convinced of some computation result, whereas in the PVC model only the client that issued a query (or anyone who trusts this client) can verify that the server returned a valid signature (proof) for the answer to the query. Our techniques can be readily adapted to construct PVC schemes with adaptive security, efficient updates and without the random oracle model.
differentiation
key
dynamics computations
queries
properties
adaptive security
SCC model
linear-time computation
verifiable computation
time
2013-01-01
optimal update
Papamanthou
Charalampos
Roberto
Tamassia
Shi
Elaine
Springer Nature
doi
10.1007/978-3-642-36594-2_13
Sahai
Amit
Information and Computing Sciences
Brown University, USA
Brown University, USA
Springer Nature - SN SciGraph project
University of Maryland, USA
University of Maryland, USA
pub.1027409438
dimensions_id
UC Berkeley, USA
UC Berkeley, USA
Computation Theory and Mathematics