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

Yehia, Mahmoud; AlTawy, Riham; Gulliver, T. Aaron

doi:10.1007/978-3-030-51938-4_12

Cited by 7 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In specific, the simulation experiments of the proposed DFORS‐SHS scheme is experimented using the back‐end model checker OFMC‐based AVISPA tool. The potential of the proposed DFORS‐SHS scheme and the benchmarked SRAUAS‐SHE, SoftAuthZ, and KSI‐AMC‐SSHE schemes are investigated based on storage cost, communication overahead, Total Number of Messages used in Authentication, Total Cost (Bytes) Incurred During Authentication, Total Energy Overhead of Smart Devices and computation costs with different number of users in the smart home authentication environment 5,17,33‐35 …”

Section: Resultsmentioning

confidence: 99%

“…In specific, the simulation experiments of the proposed DFORS-SHS scheme is exper- with different number of users in the smart home authentication environment. 5,17,[33][34][35] This experimentation is achieved using security protocol animator (SPAN) that automatically builds message sequences chart through the inherition of HLPSL specification protocol. The SPAN is mainly utilized for generating the Dolev-Yao-based threat model which is potential in investigating the reliability of the proposed DFORS-SHS scheme attributed towards authentication process.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Forest of Random Subsets‐based supervised hash signature scheme for secure user authentication in smart home environment

Sudha

Jeyanthi

2021

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe advent of information and communication technology has revolutionized the application of smart home through which the residents remotely establish superior control over the smart devices. The users and the smart devices interact over an insecure communication channel that may help an illegitimate user to gain access on the data disseminated by the smart devices, resulting in high exploiting attacks like privileged insider attack, smart device and gateway node impersonation attack, and smart node capture attack in the smart home. Thus, a secure remote authentication scheme that permits only legitimate users to gain access to the smart devices based on supervised learning becomes essential. In this article, Dynamic Forest of Random Subsets‐based supervised hash signature (DFORS‐SHS) scheme is proposed for robust user authentication in smart homes. This proposed DFORS‐SHS scheme concurrently performs the signed generation of random subsets such that each element of a signature is used for the generation of successive random subset elements for authentication. It utilized the strength of revealed secret keys through chaining approach that bundles the random subset generation and signature. This supervised learning approach only permits the signer of the original message to potentially generate a random subset and prevents the malicious intruder from gaining the access of the smart devices. The formal verification and the security investigation of the proposed DFORS‐SHS scheme are conducted using the Burrows‐Abadi‐Needham (BAN) and AVIPSA toolkit for determining communication cost, communication time, computation time, and energy consumptions incurred during the authentication process. It can be stated that, the communication cost and storage costs of the proposed DFORS‐SHS scheme was also identified to be comparatively minimized than the baseline smart home authentication schemes.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Dynamic Forest of Random Subsets‐based supervised hash signature scheme for secure user authentication in smart home environment

Sudha

Jeyanthi

2021

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…In addition, Yehia et al [40] analyze the security of FORS in SPHINCS+ and proposes a variant of FORS called DFORS. The motivation of DFORS also comes from a consideration about the non-target cases.…”

Section: Related Workmentioning

confidence: 99%

On subset-resilient hash function families

Yuan

Tibouchi

Abe

2022

Des. Codes Cryptogr.

View full text Add to dashboard Cite

In this paper, we analyze the security of subset-resilient hash function families, which is first proposed as a requirement of a hash-based signature scheme called HORS. Let $${\mathcal {H}}$$ H be a family of functions mapping an element to a subset of size at most k. (r, k)-subset resilience guarantees that given a random function H from $${\mathcal {H}}$$ H , it is hard to find an $$(r+1)$$ ( r + 1 ) -tuple $$(x,x_1,\ldots ,x_r)$$ ( x , x 1 , … , x r ) such that (1) H(x) is covered by the union of $$H(x_i)$$ H ( x i ) and (2) x is not equal to any $$x_i$$ x i . Subset resilience and its variants are related to nearly all existing stateless hash-based signature schemes, but the power of this security notion is lacking in research. We present three results on subset resilience. First, we show a generic quantum attack against subset resilience, whose time complexity is smaller than simply implementing Grover’s search. Second, we show that subset-resilient hash function families imply the existence of distributional collision-resistant hash function families. Informally, distributional collision resistance is a relaxation of collision resistance, which guarantees that it is hard to find a uniform collision for a hash function. This result implies a comparison among the power of subset resilience, collision resistance, and distributional collision resistance. Third, we prove the fully black-box separation from one-way permutations.

show abstract

“…In addition, according to the constructions in Figures 8 and 11, it is possible to construct a hash‐based stateless signature scheme (with a large number of signing operations). In the construction in Figure 11, an

n

‐time stateless signature scheme is needed, and it can be instantiated with hash‐based few‐time signature schemes, such as HORS [28], HORS++ [29], HORST [2], PORS [30], FORS [31] and DFORS [32]. HORS++ is based on the one‐way property of hash functions and a cover‐free family, and the others are based on the one‐way and hardness properties of subset resilience problems.…”

Section: Generality Of Our Frameworkmentioning

confidence: 99%

Security notions for stateful signature schemes

Yuan

Tibouchi

Abe

2021

IET Information Security

View full text Add to dashboard Cite

In some digital signature schemes, the signer needs to maintain a dynamic state while signing messages. These are called stateful signature schemes. Although stateful signature schemes are commonly used as cryptographic primitives, they do not fit the standard definition of a signature scheme in cryptography. In this work, formal and general definitions for stateful signature schemes are given. In the definitions of security notions, various scenarios are considered where the adversaries have different levels of control over the signing oracle in terms of messages and states. After that, generic constructions of stateful signature schemes with different security levels are provided. In addition, some black-box constructions of stateful signature schemes that can be instantiated by primitives under any assumptions are given. Note that the constructions in this work are proven to be secure in standard models.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

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

Cited by 7 publications

References 21 publications

Dynamic Forest of Random Subsets‐based supervised hash signature scheme for secure user authentication in smart home environment

Dynamic Forest of Random Subsets‐based supervised hash signature scheme for secure user authentication in smart home environment

On subset-resilient hash function families

Security notions for stateful signature schemes

Contact Info

Product

Resources

About