Authenticated Relational Tables and Authenticated Skip Lists

Battista, Giuseppe Di; Palazzi, Bernardo

doi:10.1007/978-3-540-73538-0_3

Cited by 24 publications

(20 citation statements)

References 21 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another authenticated structure that can be used to verify the integrity of queries searching for a key value in a set of elements is represented by skip lists [33]. A skip list for a set S of distinct key values is a set of lists S 0 , S 1 , .…”

Section: Deterministic Approachesmentioning

confidence: 99%

Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud

Vimercati

Foresti

Livraga

et al. 2016

The New Codebreakers

View full text Add to dashboard Cite

Abstract. Companies as well as individual users are adopting cloud solutions at an over-increasing rate for storing data and making them accessible to others. While migrating data to the cloud brings undeniable benefits in terms of data availability, scalability, and reliability, data protection is still one of the biggest concerns faced by data owners. Guaranteeing data protection means ensuring confidentiality and integrity of data and computations over them, and ensuring data availability to legitimate users. In this chapter, we survey some approaches for protecting data in the cloud that apply basic cryptographic techniques, possibly complementing them with additional controls, to the aim of producing efficient and effective solutions that can be used in practice.

show abstract

Section: Deterministic Approachesmentioning

confidence: 99%

Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud

Vimercati

Foresti

Livraga

et al. 2016

The New Codebreakers

View full text Add to dashboard Cite

show abstract

“…Li et al [20] propose to transform B-trees, used by DBMS for indexes, into an ADS, hence requiring support from the DBMS itself. The problem of efficiently storing ADSes into a regular DBMS has been studied by Miklau and Suciu [3] for Merkle trees and by Di Battista and Palazzi [2] for authenticated skip lists.…”

Section: State Of the Artmentioning

confidence: 99%

“…We introduce, for each attribute a of T , a security table S a . Each security table represents an authenticated skip list (see Section 3) that allows the client to easily certify completeness and integrity of the result of monodimensional basic queries in canonical form on a using the techniques described in [2]. Given a monodimensional canonical basic We are now ready to introduce the query race technique.…”

Section: Completeness Certification For Multidimensional Basic Queriesmentioning

confidence: 99%

“…Many proposal can be found in literature, some are based on authenticated data structures [1,2,3,4,5], some on the insertion of spurious data [6,7], some on signatures aggregation [8]. Each of them has strengths and weaknesses with respect to efficiency, privacy, kind of queries supported, etc.…”

Section: Introductionmentioning

confidence: 99%

“…By using authenticated skip lists represented into regular tables [2], our technique is easy to implement on any DBMS without need for specific support on the server. Also, if our technique should be applied to a pre-existing database, no change to its schema is needed and tables storing authenticated skip lists can also be stored on a different and independent server.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Query Racing: Fast Completeness Certification of Query Results

Palazzi¹,

Pizzonia²,

Pucacco³

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We present a general and effective method to certify completeness of query results on relational tables stored in an untrusted DBMS. Our main contribution is the concept of "Query Race": we split up a general query into several single attribute queries, and exploit concurrency and speed to bind the complexity to the fastest of them. Our method supports selection queries with general composition of conjunctive and disjunctive order-based conditions on different attributes at the same time. To achieve our results, we require neither previous knowledge of queries nor specific support by the DBMS.We validate our approach with experimental results performed on a prototypical implementation.

show abstract

Data integrity verification scheme with designated verifiers for dynamic outsourced databases

Wang

Yue

Guo-xiang

2013

Security Comm Networks

View full text Add to dashboard Cite

In order to verify the integrity of the query results in outsourced database model, we first present a new authenticated data structure by combining skip lists with polynomial functions and accumulators and then construct a data integrity verification scheme for range query. Our scheme can verify the integrity of the query results with constant time verification and constant size proof and support dynamic maintenance with constant computational cost. Compared with that of previous schemes, the communication cost in our scheme is independent of the size of the authenticated dataset and is lower. When dataset size gets larger enough, our scheme outperforms previous schemes in terms of the computational cost and verification cost. In addition, we introduce the designated verifier idea into our scheme, so our scheme achieves the result that none but subscribers can verify the integrity of the query results and then meets the practical demands such as the payment service. The proof of security and analysis of experiment performance show that our scheme is secure and efficient for larger outsourced databases. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Authenticated Relational Tables and Authenticated Skip Lists

Cited by 24 publications

References 21 publications

Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud

Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud

Query Racing: Fast Completeness Certification of Query Results

Data integrity verification scheme with designated verifiers for dynamic outsourced databases

Contact Info

Product

Resources

About