Conference Proceeding Article
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.
Aggregated signature, Authentication, Data publishing, Merkle hash tree
Databases and Information Systems | Information Security
Cybersecurity; Data Management and Analytics
Information and Communications Security: 7th International Conference, ICICS 2005, Beijing, China, December 10-13: Proceedings
City or Country
MA, Di; DENG, Robert H.; PANG, Hwee Hwa; and ZHOU, Jianying.
Authenticating Query Results in Data Publishing. (2005). Information and Communications Security: 7th International Conference, ICICS 2005, Beijing, China, December 10-13: Proceedings. 3783, 376-388. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/593
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.