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.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Authenticating Query Results in Data Publishing
Robert H. Deng
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA