TY - CHAP
T1 - Optimal Verification of Operations on Dynamic Sets
T2 - Advances in Cryptology – CRYPTO 2011
Y1 - 2011
A1 - Charalampos Papamanthou
A1 - Tamassia, Roberto
A1 - Triandopoulos, Nikos
ED - Rogaway, Phillip
KW - Computer Communication Networks
KW - computers and society
KW - Data Encryption
KW - Discrete Mathematics in Computer Science
KW - Management of Computing and Information Systems
KW - Systems and Data Security
AB - We study the design of protocols for set-operation verification, namely the problem of cryptographically checking the correctness of outsourced set operations performed by an untrusted server over a dynamic collection of sets that are owned (and updated) by a trusted source. We present new authenticated data structures that allow any entity to publicly verify a proof attesting the correctness of primitive set operations such as intersection, union, subset and set difference. Based on a novel extension of the security properties of bilinear-map accumulators as well as on a primitive called accumulation tree, our protocols achieve optimal verification and proof complexity (i.e., only proportional to the size of the query parameters and the answer), as well as optimal update complexity (i.e., constant), while incurring no extra asymptotic space overhead. The proof construction is also efficient, adding a logarithmic overhead to the computation of the answer of a set-operation query. In contrast, existing schemes entail high communication and verification costs or high storage costs. Applications of interest include efficient verification of keyword search and database queries. The security of our protocols is based on the bilinear q-strong Diffie-Hellman assumption.
JA - Advances in Cryptology – CRYPTO 2011
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-642-22791-2, 978-3-642-22792-9
UR - http://link.springer.com/chapter/10.1007/978-3-642-22792-9_6
ER -