54 search results - page 1 / 11 » Efficient Protocols for Set Membership and Range Proofs |
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
ACNS
2007
Springer
13 years 9 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...
ACNS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
TCC
2010
Springer
14 years 8 days ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...