Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors

Atallah, Mikhail J.; Cho, YounSun; Kundu, Ashish

doi:10.1109/icde.2008.4497478

Cited by 24 publications

(29 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2 Then we present an authenticated dictionary data structure that is based on a new cryptographic primitive that was recently proposed by Silverberg and Boneh, namely multilinear forms [10], the construction of which remains however an open problem to date. The use of such a primitive gives an authenticated dictionary with constant communication and constant verification complexity, while maintaining all other complexities logarithmic.…”

Section: Introductionmentioning

confidence: 99%

Optimal Authenticated Data Structures with Multilinear Forms

Papamanthou

Tamassia

Triandopoulos

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Cloud computing and cloud storage are becoming increasingly prevalent. In this paradigm, clients outsource their data and computations to third-party service providers. Data integrity in the cloud therefore becomes an important factor for the functionality of these web services. Authenticated data structures, implemented with various cryptographic primitives, have been widely studied as a means of providing efficient solutions to data integrity problems (e.g., Merkle trees). In this paper, we introduce a new authenticated dictionary data structure that employs multilinear forms, a cryptographic primitive proposed by Silverberg and Boneh in 2003 [10], the construction of which, however, remains an open problem to date. Our authenticated dictionary is optimal, that is, it does not add any extra asymptotic cost to the plain dictionary data structure, yielding proofs of constant size, i.e., asymptotically equal to the size of the answer, while maintaining other relevant complexities logarithmic. Instead, solutions based on cryptographic hashing (e.g., Merkle trees) require proofs of logarithmic size [40]. Because multilinear forms are not known to exist yet, our result can be viewed from a different angle: if one could prove that optimal authenticated dictionaries cannot exist in the computational model, irrespectively of cryptographic primitives, then our solution would imply that cryptographically interesting multilinear form generators cannot exist as well (i.e., it can be viewed as a reduction). Thus, we provide an alternative avenue towards proving the nonexistence of multilinear form generators in the context of general lower bounds for authenticated data structures [40] and for memory checking [18], a model similar to the authenticated data structures model.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimal Authenticated Data Structures with Multilinear Forms

Papamanthou

Tamassia

Triandopoulos

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In ADS, a trusted source outsources the data or a data structure, and the client wishes to verify the correctness of the result of a data structure query, e.g., dictionaries [19,28], graphs [21,27] and hash tables [32,37]. Most authenticated data structures schemes incur logarithmic or linear overheads for verification costs, with some exceptions being authenticated range queries [2,20] and set operations [33], where verification takes time proportional to the size of the answer. Verifiable computation in the secret key setting (SVC).…”

Section: Related Workmentioning

confidence: 99%

“…Specifically, let S denote the multiset corresponding to that coefficient. 2 Suppose the current function public key is FK(f ).…”

Section: Detailed Constructionmentioning

confidence: 99%

Signatures of Correct Computation

Papamanthou

Shi

Tamassia

2013

Lecture Notes in Computer Science

131

View full text Add to dashboard Cite

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.

show abstract

“…The above schemes cannot be applied to our model, since we assume that the DO and the client are separate entities, and that the clients are not trusted. Atallah et al [2] introduce a theoretical approach that provides lower asymptotic bounds for the VO size than MH-based techniques.…”

Section: Related Workmentioning

confidence: 99%

“…The function takes the same arguments as InsertDPM, where r is now the record to be deleted. DeleteDPM first traverses the tree until reaching the leaf N that accommodates r (lines [1][2][3][4]. If N is the root, or its sibling (denoted by N.sb) is not a leaf, the procedure simply deletes r from TMH-Tree N .R (lines 6-7).…”

Section: Indexing Schemementioning

confidence: 99%

Continuous authentication on relational streams

2009

View full text Add to dashboard Cite

According to the database outsourcing model, a data owner delegates database functionality to a thirdparty service provider, which answers queries received from clients. Authenticated query processing enables the clients to verify the correctness of query results. Despite the abundance of methods for authenticated processing in conventional databases, there is limited work on outsourced data streams. Stream environments pose new challenges such as the need for fast structure updating, support for continuous query processing and authentication, and provision for temporal completeness. Specifically, in addition to the correctness of individual results, the client must be able to verify that there are no missing results in between data updates. This paper presents a comprehensive set of methods covering relational streams. We first describe REF, a technique that achieves correctness and temporal completeness but incurs false transmissions, i.e., the provider has to inform the clients whenever there is a data update, even if their results are not affected. Then, we propose CADS, which minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. In addition, we present an analytical study to determine the optimal indexing granularity, and extend CADS for the case that the data distribution changes over time. Finally, we evaluate the effectiveness of our techniques through extensive experiments.

show abstract

Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors

Cited by 24 publications

References 1 publication

Optimal Authenticated Data Structures with Multilinear Forms

Optimal Authenticated Data Structures with Multilinear Forms

Signatures of Correct Computation

Continuous authentication on relational streams

Contact Info

Product

Resources

About