PSI
sdsl-lite
PSI | sdsl-lite | |
---|---|---|
3 | 5 | |
125 | 2,174 | |
0.0% | - | |
5.2 | 0.0 | |
26 days ago | 11 months ago | |
C++ | C++ | |
Apache License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
PSI
-
Can a new form of cryptography solve the internet’s privacy problem?
There are other techniques that aren't generally included in the "Zero Knowledge Proofs" set of techniques that are perhaps more practical for general development.
For example, I fine private set intersection[1] as implemented by OpenMined a really useful primative a bunch of privacy enhancing applications can be built on top of.
My colleagues and I recently published a pre-print[2] showing how to use this for sharing locations you and another person have had in common, without being able to see other locations. The paper talks about a social network built around this but I also think there are useful applications in things like real-world games (scavenger hunts etc)
[1] https://github.com/OpenMined/PSI/blob/master/private_set_int...
[2] https://arxiv.org/abs/2210.01927
-
Ask HN: What are some 'cool' but obscure data structures you know about?
I came here to say Golomb compressed sets except now I see it's part of the question!
They are used by default in the OpenMined implementation of Private Set Intersection[1] - a multi-party computation technique.
[1] https://github.com/OpenMined/PSI/blob/master/private_set_int...
-
Is there a Private Set Intersection protocol where the server learns the length of the intersection?
I was using OpenMinded/PSI exploring some PSI implementations, but I would like a way for the server to know the intersection size. Say Signal wants to calculate the average number of users from one person's address book (or whatever).
sdsl-lite
- SDSL – Succinct Data Structure Library
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Succinct Data Structures [0] [1]. It encompass many different underlying data structure types but the overarching idea is that you want small data size while still keeping "big O" run time.
In other words, data structures that effectively reach a 'practical' entropy lower bound while still keeping asymptotic run time.
[0] https://en.wikipedia.org/wiki/Succinct_data_structure
[1] https://github.com/simongog/sdsl-lite
-
SDSL-RS: A Rust interface for the C++ Succinct Data Structure Library.
The book mentioned in another comment is probably the best way to go. But FYI, documentation for some data structures include references. An SDSL-lite example can be found here. And its equivalent in SDSL-RS can be found here.
What are some alternatives?
ctrie-java - Java implementation of a concurrent trie
plurid-data-structures-typescript - Utility Data Structures Implemented in TypeScript
AspNetCoreDiagnosticScenarios - This repository has examples of broken patterns in ASP.NET Core applications
sdsl-lite - Succinct Data Structure Library 3.0
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
minisketch - Minisketch: an optimized library for BCH-based set reconciliation
cheerp-meta - Cheerp - a C/C++ compiler for Web applications - compiles to WebAssembly and JavaScript
dictomaton - Finite state dictionaries in Java
swift - the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
gring - Golang circular linked list with array backend
pvfmm - A parallel kernel-independent FMM library for particle and volume potentials
pyroscope - Continuous Profiling Platform. Debug performance issues down to a single line of code [Moved to: https://github.com/grafana/pyroscope]