2018
DOI: 10.1007/978-3-030-01446-9_15
|View full text |Cite
|
Sign up to set email alerts
|

Generic Double-Authentication Preventing Signatures and a Post-quantum Instantiation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…The DAPS is existential unforgeability under chosen message attacks (EUF − CMA) secure in the random oracle model [32]. As a building block, it can be replaced by other double authentication preventing signature such as the post-quantum instantiation against quantum computer attacks and interested readers can refer to [33].…”
Section: Double Authentication Preventing Signaturesmentioning
confidence: 99%
“…The DAPS is existential unforgeability under chosen message attacks (EUF − CMA) secure in the random oracle model [32]. As a building block, it can be replaced by other double authentication preventing signature such as the post-quantum instantiation against quantum computer attacks and interested readers can refer to [33].…”
Section: Double Authentication Preventing Signaturesmentioning
confidence: 99%
“…In order to provide forward security (and also achieve resilience against LRSL attack and other long-range attacks), Ouroboros Paros [9] and Ouroboros Genesis [22] formalize and realize in the universal composition setting a forward secure digital signature scheme, Algorand [23] considers it as one of future work and implements ephemeral key pairs in its updated full version [24], whereas Snow White [13] and Ouroboros [12] adopt a weak adaptive corruption model and cannot avoid LRSL attack. In addition, several countermeasures have been proposed, such as the trusted execution environments [1], checkpointing mechanism [25], and punishment mechanism revealing the real identity [1], revealing the signing key [26] or slashing the stake [27] of the malicious stakeholder.…”
Section: Related Workmentioning
confidence: 99%
“…On the basis of the digital signatures in Refs. [14][15][16], most designed DAPS based on discrete logarithm problems and large integer factorization problems face new challenges because there exist polynomial computational complexity quantum algorithms to solve the two problems, such as Shor algorithm [17,18] . Hence, it is necessary to study some post quantum secure DAPS.…”
Section: Introductionmentioning
confidence: 99%