Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with accumulators
Search options not deleted
user 33994
A cryptographic accumulator is a one way membership function. It answers a query as to whether a potential candidate is a member of a set without revealing the individual members of the set.
1
vote
Accepted
Dynamic accumulator with only non-membership witness
This is not a correct dynamic accumulator scheme.
Your scheme assumes that the following holds: if $a,b$ are primes and $0< a,b < p$, then $$(a,b)=1 \implies (ab\mod p,a)\neq1. $$ If this is true, t …
- 1,194
0
votes
Accepted
Exclusion proof cost
Pairing-based accumulator
Damgard et al. creates non-membership proofs for pairing-based accumulators. …
- 1,194
2
votes
Inclusion and Exclusion proofs in RSA accumulators
No and Yes! For the inclusion proof you either need the trapdoor or the accumulated set. However, it is possible to generate exclusion proofs without knowing the trapdoor, i.e. the factorization of th …
- 1,194
2
votes
RSA Accumulators with auxiliary information or known trapdoor information
For the inclusion proof you might need the trapdoor or the accumulated set. The exclusion proof can be generated without knowing the trapdoor. See this related question and answer.
How can one genera …
- 1,194
1
vote
RSA accumulator exclusion proof without set
Are there any accumulators that do not require the knowledge of the full set for computing exclusion proofs ?
The simplest example could be a sorted Merkle-tree used as an accumulator. …
- 1,194