CHIFFREMENT ADAPTATIF AUX REQUETES UTILISATEURS OUTSOURCING
Résumé
Le chiffrement est une technique conçue pour assurer la confidentialité des données sensibles. Il est capable de garantir unehaute sécurité des données, mais il peut imposer des coûts substantiels sur la performance d'un système dans la gestion de ces
données, traitement CPU (niveau site client) pour le chiffrement/déchiffrement et le filtrage des données, transmission des
données (Quantité d'informations) sur le réseau entre le serveur et le client.
Dans cet article, nous avons traité cette problématique dans le cas d'une base de données relationnelle chiffrée et hébergé chez
un fournisseur de services. En effet, nous proposons une approche de chiffrement adaptatif aux requêtes des utilisateurs, qui
combine le chiffrement et la fragmentation verticale.
Références
[1] B. Iyer1, S. Mehrotra2, E. Mykletun, G. Tsudik, and
Y. Wu “A Framework for Efficient Storage” Security
in RDBMS, Advances in database technology - EDBT
2004 pp. 147-164 (Heraklion, 14-18 March 2004)
[2] H. Hacigumus, B. Iyer, and S. Mehrotra, “Providing
database as a service” in International Conference on
Data Engineering, pp. 0029 © 2002 IEEE.
[3] H. Hacigumus, B. Iyer, C. Li, and S. Mehrotra,
“Executing sql over encrypted data in the database-
service provider model” in ACM SIGMOD
Conference on Management of Data, pp. 216-227,
ACM Press, June 2002.
[4] H. Hacigumus, B. Iyer, and S. Mehrotra, .”Efficient
execution of aggregation queries over encrypted
databases” in International Conference on Database
Systems for Advanced Applications (DASFAA), 2004.
pp.125-136
[5] H. Hacigumus, B. Iyer, and S. Mehrotra, “Managing
and Querying Encrypted Data” Handbook of Database
Security Applications and Trends, © 2008 Springer
Science+Business Media, LLC (pp172-199).
[6] S. Chakravarthy, J. Muthuraj, R. Varadarajan, and S.
Navathe, “An objective function for vertically
partitioning relations in distributed databases and its
analysis” Distributed and Parallel Databases 2 ©
Springer (2004) pp. 183-207.
[7] W.T. MCCORMICK, P.J. SCHWEITZER, AND T.W
WHITE,”Problem decomposition and data
reorganization by a clustering technique”. Oper. Res.
20,5 (Sept. 1972), pp. 993-1009.
[8] S. B. Navathe, S. Ceri, G. Wiederhold, and J. Dour,
“Vertical partitioning algorithms for database design”
ACM TODS, vol. 9, no. 4, pp. 680-710, 1984.
[9] D. Cornell and P. Yu, “A vertical partitioning
algorithm for relational databases” in International
Conference on Data Engineering, Los Angeles,
California, 1987, pp. 30-35.
[10] S. B. Navathe and M. Ra, “Vertical partitioning for
database design: A graphical algorithm” SIGMOD
Record, vol. 14, no. 4, pp. 440-450, 1989.
Y. Wu “A Framework for Efficient Storage” Security
in RDBMS, Advances in database technology - EDBT
2004 pp. 147-164 (Heraklion, 14-18 March 2004)
[2] H. Hacigumus, B. Iyer, and S. Mehrotra, “Providing
database as a service” in International Conference on
Data Engineering, pp. 0029 © 2002 IEEE.
[3] H. Hacigumus, B. Iyer, C. Li, and S. Mehrotra,
“Executing sql over encrypted data in the database-
service provider model” in ACM SIGMOD
Conference on Management of Data, pp. 216-227,
ACM Press, June 2002.
[4] H. Hacigumus, B. Iyer, and S. Mehrotra, .”Efficient
execution of aggregation queries over encrypted
databases” in International Conference on Database
Systems for Advanced Applications (DASFAA), 2004.
pp.125-136
[5] H. Hacigumus, B. Iyer, and S. Mehrotra, “Managing
and Querying Encrypted Data” Handbook of Database
Security Applications and Trends, © 2008 Springer
Science+Business Media, LLC (pp172-199).
[6] S. Chakravarthy, J. Muthuraj, R. Varadarajan, and S.
Navathe, “An objective function for vertically
partitioning relations in distributed databases and its
analysis” Distributed and Parallel Databases 2 ©
Springer (2004) pp. 183-207.
[7] W.T. MCCORMICK, P.J. SCHWEITZER, AND T.W
WHITE,”Problem decomposition and data
reorganization by a clustering technique”. Oper. Res.
20,5 (Sept. 1972), pp. 993-1009.
[8] S. B. Navathe, S. Ceri, G. Wiederhold, and J. Dour,
“Vertical partitioning algorithms for database design”
ACM TODS, vol. 9, no. 4, pp. 680-710, 1984.
[9] D. Cornell and P. Yu, “A vertical partitioning
algorithm for relational databases” in International
Conference on Data Engineering, Los Angeles,
California, 1987, pp. 30-35.
[10] S. B. Navathe and M. Ra, “Vertical partitioning for
database design: A graphical algorithm” SIGMOD
Record, vol. 14, no. 4, pp. 440-450, 1989.
Comment citer
SAAD, FEHIS.
CHIFFREMENT ADAPTATIF AUX REQUETES UTILISATEURS OUTSOURCING.
Courrier du Savoir, [S.l.], v. 14, mai 2014.
ISSN 1112-3338.
Disponible à l'adresse : >https://revues.univ-biskra.dz./index.php/cds/article/view/413>. Date de consultation : 14 nov. 2024
Rubrique
Articles
