MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Cryptography and Data Security
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,083 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,083 works in the cohort · of 4,299,418page 2 of 22

Labels cover 2 of 1,083 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,083 of 1,083 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Shrinkwrap
Johes Bater, Xi He, William Ehrich, Ashwin Machanavajjhala, Jennie Rogers
2018· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
91
citations
affno abstractunlabeled
IP multicast security: Issues and directions
Thomas Hardjono, Gene Tsudik
2000· article· fr· Annals of Telecommunications· Computer Science
machine prediction:candidate · noneconsensus · none
85
citations
affno abstractunlabeled
Provably Secure Implicit Certificate Schemes
Daniel R. L. Brown, Robert Gallant, Scott A. Vanstone
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
81
citations
fundno affunlabeled
Attribute-Based Encryption for Circuits
S. Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2015· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
77
citations
affno abstractunlabeled
Dynamic Secure Cloud Storage with Provenance
Sherman S. M. Chow, Cheng‐Kang Chu, Xinyi Huang, Jianying Zhou, Robert H. Deng
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
77
citations
affno abstractunlabeled
Fully Adaptive Schnorr Threshold Signatures
Elizabeth C. Crites, Chelsea Komlo, Mary Maller
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
Non-Automatizability of Bounded-Depth Frege Proofs
Marı́a Luisa Bonet, Carlos Domingo, Ricard Gavald�, Alexis Maciel, Toniann Pitassi
2004· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
71
citations
affno abstractunlabeled
Waters Signatures with Optimal Security Reduction
Dennis Hofheinz, Tibor Jager, Edward Knapp
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
Another Look at Tightness
Sanjit Chatterjee, Alfred Menezes, Palash Sarkar
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
afffundunlabeled
DP5: A Private Presence Service
Nikita Borisov, George Danezis, Ian Goldberg
2015· article· en· Proceedings on Privacy Enhancing Technologies· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
afffundno abstractunlabeled
Oblivious Transfers and Privacy Amplification
Gilles Brassard, Claude Crépeau, Stefan Wolf
2003· article· en· Journal of Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
fundno affunlabeled
[no title]
Anne Broadbent
2018· article· en· Theory of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
59
citations
affno abstractunlabeled
Provably Weak Instances of Ring-LWE
Yara Elias, Kristin Lauter, Ekin Özman, Katherine E. Stange
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affunlabeled
A Survey of Public-Key Cryptosystems
Neal Koblitz, Alfred Menezes
2004· article· en· SIAM Review· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
affunlabeled
Cake cutting really is not a piece of cake
Jeff Edmonds, Kirk Pruhs
2006· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
affunlabeled
Practical PIR for electronic commerce
Ryan Henry, Femi Olumofin, Ian Goldberg
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
Comparing two pairing-based aggregate signature schemes
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp, Alfred Menezes
2009· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
← previousnext →

How this was built: Screen · Findings · About