src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 07, 2026 01:24 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
ePrint Report: Simple Extremely Lossy Functions from Small-Exponent Hashing Damiano Abram, Agni Datta, Archisman Dutta, Lawrence Roy Extremely Lossy Functions (ELFs) are a standard model primitive that captures many useful properties of random oracles (Zhandry, Crypto 2016). While there are many variations of ELFs with additional properties, every construction (excluding obfuscation) has followed
Simple Extremely Lossy Functions from Small-Exponent Hashing0b339218ea14c47c52ca59c19eec6a05fc0a7bb7d1ec6027ed3b5e5609e40f0aNetwork indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 1 unverified.
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.