Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Is the security of the Golomb-based scheme solely based on having a large domain and a strong hash? #123

Closed
jellevos opened this issue Apr 7, 2021 · 1 comment
Labels
Type: Question ❔ Question about implementation or some technical aspect

Comments

@jellevos
Copy link

jellevos commented Apr 7, 2021

Question

Is the security of the Golomb-based scheme solely based on having a large domain and a strong hash?

Further Information

First, this repository looks very nice! Congratulations on the project and the support for so many different languages. I noticed that you have switched from Bloom filters to Golomb-coded sets since they are more compact. However, looking through the code I got the impression that the receiver would be able to see the entire Golomb-encodings. Does this not allow the receiver to retrieve the entire encoded set if the domain is small enough (or the hash is not strong)?

@jellevos jellevos added the Type: Question ❔ Question about implementation or some technical aspect label Apr 7, 2021
@s0l0ist
Copy link
Contributor

s0l0ist commented Oct 2, 2024

In short, yes.

The receiver does indeed see the encoded set. However, the security assumption is that without knowledge of the original set and with a sufficiently large domain, the encoded set alone does not provide enough information to recover the original set.

@s0l0ist s0l0ist closed this as completed Oct 2, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Type: Question ❔ Question about implementation or some technical aspect
Projects
None yet
Development

No branches or pull requests

2 participants