How to Let Everyone Keep a Secret
The article discusses a method for sharing secrets without revealing them to individuals. It explains Shamir's Secret Sharing, a technique developed by Adi Shamir in 1979, which allows a secret to be divided into parts that can only be reconstructed when a certain number of parts are combined. The concept is illustrated using geometric equations to demonstrate how multiple points can be used to derive a secret value.
- ▪Shamir's Secret Sharing allows secrets to be divided into parts for secure sharing.
- ▪At least two points are needed to reconstruct the secret from the shared parts.
- ▪The method can be extended to require more participants for unlocking the secret.
Hackaday files mainly under tech. We currently carry 194 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Hackaday |
| Canonical URL | https://hackaday.com/2026/05/28/how-to-let-everyone-keep-a-secret/ |
| Publication time | Fri, 29 May 2026 02:00:42 +0000 |
| Retrieval time | 2026-05-29T02:04:41.175Z |
| Last seen | 2026-05-29T02:04:41.175Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | kVXlU2LD5PSC |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
How To Let Everyone Keep A Secret No comments by: Al Williams May 28, 2026 Title: Copy Short Link: Copy Someone calls you at work and says, “Don’t tell anyone, but…” If you are like most people, there are one or two people you will pass it along to with the same admonishment. In fact, they are probably repeating it from someone else, and you are on their list of two people. So for really big secrets, you need a way to spread the secret out so that no one has any real information about the secret, but a certain number of people together can decode it. As [neeaj] explains in a recent post about Shamir’s Secret Sharing, [Adi Shamir] (the S in RSA encryption) devised a way to do this very well in 1979, and the core concept is very easy to understand. The explanation works with geometry.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Hackaday.
Discussion
0 commentsMore from Hackaday
