In the last few years, many efforts have been devoted to the development of solutions aiming at ensuring the confidentiality and integrity of data and computations in the cloud. In particular, a recent solution for verifying the integrity of equi-join queries is based on the insertion of checks (markers and twins) whose presence provides probabilistic guarantees on the integrity of the computation. In this paper, we propose an approach for verifying the integrity of approximate join queries, which is based on the introduction of a discretized version of the join attribute and on the translation of the approximate join into an equi-join defined over the discrete attribute added to the original relations. The proposed approach guarantees the correctness and completeness of the join result, while causing a limited overhead for the user.
Integrity for approximate joins on untrusted computational servers / S. De Capitani di Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, P. Samarati (IFIP ADVANCES IN INFORMATION AND COMMUNICATION TECHNOLOGY). - In: ICT systems security and privacy protection : 30. IFIP TC 11 International Conference, SEC 2015, Hamburg, Germany, May 26–28, 2015 : Proceedings / [a cura di] H. Federrath, D. Gollmann. - Cham : Springer, 2015. - ISBN 9783319184661. - pp. 446-459 (( Intervento presentato al 30. convegno IFIP International information security and privacy conference (SEC) : International federation for information processing (IFIP) Technical Committee 11 on Information security and privacy protection in information processing systems (TC-11) tenutosi a Hamburg (Germany) nel 2015 [10.1007/978-3-319-18467-8_30].
Integrity for approximate joins on untrusted computational servers
S. De Capitani di Vimercati;S. Foresti;P. Samarati
2015
Abstract
In the last few years, many efforts have been devoted to the development of solutions aiming at ensuring the confidentiality and integrity of data and computations in the cloud. In particular, a recent solution for verifying the integrity of equi-join queries is based on the insertion of checks (markers and twins) whose presence provides probabilistic guarantees on the integrity of the computation. In this paper, we propose an approach for verifying the integrity of approximate join queries, which is based on the introduction of a discretized version of the join attribute and on the translation of the approximate join into an equi-join defined over the discrete attribute added to the original relations. The proposed approach guarantees the correctness and completeness of the join result, while causing a limited overhead for the user.File | Dimensione | Formato | |
---|---|---|---|
dfjps-sec2015.pdf
accesso aperto
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
426.88 kB
Formato
Adobe PDF
|
426.88 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.