On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations.
Bibliographic record
Abstract
This book constitutes the proceedings of the 6th International Conference on Information Theoretic Security, ICITS 2012, held in Montreal, Canada, in August 2012. The 11 full papers presented in this volume were carefully reviewed and selected from 46 submissions. In addition 11 papers were selected for the workshop track, abstracts of 7 of these contributions are also included in this book. Topics of interest are: physical layer security; multiparty computations; codes, lattices and cryptography; authentication codes; randomness extraction; cryptography from noisy channels; wiretap channels; bounded-storage models; information-theoretic reductions; quantum cryptography; quantum information theory; nonlocality and nonsignaling; key and message rates; secret sharing; physical models and assumptions; network coding security; adversarial channel models; information-theoretic tools in computational settings; implementation challenges; and biometric security.
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.010 | 0.046 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.004 | 0.004 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.004 | 0.008 |
| Scholarly communication | 0.010 | 0.032 |
| Open science | 0.006 | 0.011 |
| Research integrity | 0.004 | 0.014 |
| Insufficient payload (model declined to judge) | 0.017 | 0.003 |
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".