Publication Type

Conference Proceeding Article

Publication Date

12-2005

Abstract

We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.

Keywords

Aggregated signature, Authentication, Data publishing, Merkle hash tree

Discipline

Databases and Information Systems | Information Security

Research Areas

Cybersecurity; Data Management and Analytics

Publication

Information and Communications Security: 7th International Conference, ICICS 2005, Beijing, China, December 10-13: Proceedings

Volume

3783

First Page

376

Last Page

388

ISBN

9783540320999

Identifier

10.1007/11602897_32

Publisher

Springer Verlag

City or Country

Berlin

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1007/11602897_32

Share

COinS