TY - GEN
T1 - Improvement of a dynamic accumulator at ICICS 07 and its application in multi-user keyword-based retrieval on encrypted data
AU - Wang, Peishun
AU - Wang, Huaxiong
AU - Pieprzyk, Josef
N1 - Copyright 2008 IEEE. Reprinted from 2008 IEEE Asia-Pacific Services Computing Conference : APSCC 2008 : proceedings : 9-12 December 2008, Yilan, Taiwan. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
PY - 2008
Y1 - 2008
N2 - A dynamic accumulator is an algorithm, which merges a large set of elements into a constant-size value such that for an element accumulated, there is a witness confirming that the element was included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set. Recently Wang et al. presented a dynamic accumulator for batch updates at ICICS 2007. However, their construction suffers from two serious problems. We analyze them and propose a way to repair their scheme. We use the accumulator to construct a new scheme for common secure indices with conjunctive keyword-based retrieval.
AB - A dynamic accumulator is an algorithm, which merges a large set of elements into a constant-size value such that for an element accumulated, there is a witness confirming that the element was included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set. Recently Wang et al. presented a dynamic accumulator for batch updates at ICICS 2007. However, their construction suffers from two serious problems. We analyze them and propose a way to repair their scheme. We use the accumulator to construct a new scheme for common secure indices with conjunctive keyword-based retrieval.
UR - http://www.scopus.com/inward/record.url?scp=67049173134&partnerID=8YFLogxK
U2 - 10.1109/APSCC.2008.98
DO - 10.1109/APSCC.2008.98
M3 - Conference proceeding contribution
AN - SCOPUS:67049173134
SP - 1381
EP - 1386
BT - 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
PB - Institute of Electrical and Electronics Engineers (IEEE)
CY - Piscataway, NJ
T2 - 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008
Y2 - 9 December 2008 through 12 December 2008
ER -