src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 04, 2026 21:24 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
Three-Move Blind Signatures from DL
ePrint Report: Three-Move Blind Signatures from DL Rutchathon Chairattana-Apirom, Michael Reichle, Stefano Tessaro This paper considers the problem of building blind signatures in pairing-free groups. We provide the first three-move blind signature which is provably one-more unforgeable, in the random-oracle model, under the minimal assumption that the discrete logarithm (DL) problem is hard. Our
Reference details
- Source category
- Research & news
- Report title
Three-Move Blind Signatures from DL- First reported
- Oct 04, 2026 21:24 UTC
- Last reported
- Oct 04, 2026 21:24 UTC
- Catalog updated
- Oct 08, 2026 03:46 UTC
- Record ID
6cf760920b1e5db0eb71057c77231d191d191e6867f9ee59da9c613ea5242e6c
Published indicators
Network 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.
Source observations
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Feed collection status
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.
Review source update dates and status
- src_e53adb99e40ae66258Collection status unverifiedLast successful batch: 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.