I want update in place for sorted element list and proof for accumulator encoding of only element updated. I try to find technique similar to this, but only GCTI pop up and similar methods.

It must get elements in order of sorted list, replace ith element ($e^i$) with update list element ($e'^i$) to make new accumulation with modification. I must need proof so accumulation with update and replaced element is accepted and non-update elements check to be not updated.

If anyone know method similar to this one or some place I can find, I greatly appreciate.

  • $\begingroup$ I’m not certain if I fully understand your question, but it sounds like cryptocounters as described in chapter 5 of Malicious Cryptography by Young and Yung might be the idea that you are looking for. $\endgroup$
    – Daniel S
    Commented Dec 6, 2022 at 10:03
  • $\begingroup$ Could you please indicate if the solution proposed by @DanielS is in the direction that you are looking for and why this is the case? $\endgroup$
    – Maarten Bodewes
    Commented Dec 6, 2022 at 14:14
  • $\begingroup$ Malicious Cryptography by Young and Yung I think direction of Daniel is similar, but I must expand to meet requirement. This is good start, thank you $\endgroup$ Commented Dec 6, 2022 at 23:21


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.