Anonymous Credentials: Secret-Free and Quantum-Safe
Bibliographic record
Abstract
An anonymous credential mechanism is a set of protocols that allows users to obtain credentials from an organization and demonstrate ownership of these credentials without compromising users’ privacy. In this work, we construct the first secret-free and quantum-safe credential mechanism. The scheme is secret-free in the sense that an organization does not need to guard a secret key. The scheme is also lightweight in construction. Security of the scheme relies on the ability of the organization to maintain the integrity of a publicly known data structure—namely, a Merkle tree—that utilizes a quantum-safe, partially homomorphic hash function as a foundational primitive. We also construct a simple, quantum-safe, zero-knowledge argument of knowledge of membership in the Merkle tree. Additionally, we explore a concrete instantiation of the scheme and show it to be practically efficient for the core functions of enrollment and verification.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.015 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.003 | 0.009 |
| Scholarly communication | 0.006 | 0.012 |
| Open science | 0.002 | 0.009 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".