About: Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security
Creator	Altawy, Riham Gulliver, T Yehia, Mahmoud
Source	PMC
abstract	FORS is the underlying hash-based few-time signing scheme in SPHINCS[Formula: see text], one of the nine signature schemes which advanced to round 2 of the NIST Post-Quantum Cryptography standardization competition. In this paper, we analyze the security of FORS with respect to adaptive chosen message attacks. We show that in such a setting, the security of FORS decreases significantly with each signed message when compared to its security against non-adaptive chosen message attacks. We propose a chaining mechanism that with slightly more computation, dynamically binds the Obtain Random Subset (ORS) generation with signing, hence, eliminating the offline advantage of adaptive chosen message adversaries. We apply our chaining mechanism to FORS and present DFORS whose security against adaptive chosen message attacks is equal to the non-adaptive security of FORS. In a nutshell, using SPHINCS[Formula: see text]-128s parameters, FORS provides 75-bit security and DFORS achieves 150-bit security with respect to adaptive chosen message attacks after signing one message. We note that our analysis does not affect the claimed security of SPHINCS[Formula: see text]. Nevertheless, this work provides a better understanding of FORS and other HORS variants, and furnishes a solution if new adaptive cryptanalytic techniques on SPHINCS[Formula: see text] emerge.
has issue date	2020-06-06(xsd:dateTime)
bibo:doi	10.1007/978-3-030-51938-4_12
has license	no-cc
sha1sum (hex)	e1987886acdc2cb6cd2a76aa83acd8ef104ac815
schema:url	https://doi.org/10.1007/978-3-030-51938-4_12
resource representing a document's title	Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security
has PubMed Central identifier	PMC7334985
schema:publication	Progress in Cryptology - AFRICACRYPT 2020
resource representing a document's body	covid:e1987886acdc2cb6cd2a76aa83acd8ef104ac815#body_text
is schema:about of	named entity 'attacks' named entity 'mechanism' named entity 'NOTE' named entity 'STANDARDIZATION' named entity 'PAPER' named entity 'PRESENT' named entity 'UNDERSTANDING' named entity 'claimed' named entity 'Post-Quantum Cryptography standardization' named entity 'hash function' named entity 'security parameter' named entity 'Shor's algorithm' named entity 'hash-based' named entity 'public key' named entity 'secret key' named entity 'FORS' named entity 'polynomial time' named entity 'key size' named entity 'secret keys' named entity 'public key' named entity 'tree root' named entity 'SPHINCS' named entity 'security level' named entity 'subset' named entity 'public key' named entity 'authentication' named entity 'Tree Root' named entity 'HORS' named entity 'dynamically' named entity 'signing' named entity 'hash-based' named entity 'public key' named entity 'secret key' named entity 'subset' named entity 'chosen message attacks' named entity 'subset' named entity 'Algorithm 1' named entity 'FORS' named entity 'FORS' named entity 'bit-length' named entity 'chosen message attacks' named entity 'hash tree' named entity 'hash tree' named entity 'algorithm' named entity 'hash tree' named entity 'sk 1' named entity 'hash function' named entity 'SPHINCS' named entity 'subset' named entity 'oracle' named entity 'signature scheme' named entity 'secret keys' named entity 'secret key' named entity 'hash tree' named entity 'chosen message attacks' named entity 'kilobytes' named entity 'subset' named entity 'hash trees' named entity 'birthday paradox' named entity 'McEliece' named entity 'public key' named entity 'Subset' named entity 'FORS' named entity 'paper' named entity 'FORS' named entity 'SPHINCS' named entity 'SPHINCS' named entity 'cryptanalytic' named entity 'chosen message attacks' named entity 'FORS' named entity 'secret keys' named entity 'integer representation' named entity 'subset' named entity 'secret keys' named entity 'chosen message attacks' named entity 'algorithm' named entity 'success probability' named entity 'hash function' named entity 'pseudorandom' named entity 'probability' named entity 'secret keys'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software