2 search results - page 1 / 1 » Universal Accumulators with Efficient Nonmembership Proofs |
68
Voted
ACNS
2007
Springer
15 years 1 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
100
click to vote
CCS
2008
ACM
14 years 12 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...