2019
DOI: 10.1007/978-3-030-30530-7_3
|View full text |Cite
|
Sign up to set email alerts
|

Cold Boot Attacks on Bliss

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(30 citation statements)
references
References 22 publications
0
30
0
Order By: Relevance
“…In CEMA, the general outcomes are extremely noisy and do not appear sharp in comparison to CPA results of the study [8]. Therefore, it is quite disappointing from the attacker's side.…”
Section: Discussionmentioning
confidence: 71%
See 2 more Smart Citations
“…In CEMA, the general outcomes are extremely noisy and do not appear sharp in comparison to CPA results of the study [8]. Therefore, it is quite disappointing from the attacker's side.…”
Section: Discussionmentioning
confidence: 71%
“…In CEMA modelling, the choice of method was HW because of its efficacy. The accuracy of the model was validated using the test results for [8]. The steps of the procedure:…”
Section: Attack Modellingmentioning
confidence: 99%
See 1 more Smart Citation
“…Their cold boot key-recovery algorithms were applicable to the true cold boot scenario and exploited redundancies found in the in-memory private key representations from two popular NTRU implementations. This work was followed up by that of Villanueva-Polanco [11], which studied cold boot attacks against the strongSwan implementation of the BLISS signature scheme and presented key-recovery algorithms based on key enumeration algorithms for the in-memory private key encoding used in this implementation.…”
Section: Cold Boot Attacksmentioning
confidence: 99%
“…Regarding the second task, we assume the attacker estimate α, the probability for a 0 bit of original content to turn to a 1 bit, and β, the probability for a 1 bit of original content to turn to a 0 bit, as per the cold boot model described in Section 2.2. Lastly, we develop our key-recovery algorithm based on a general key-recovery strategy introduced in [11]. Basically, by exploiting and combining the optimal key enumeration algorithm [12], and a non-optimal key enumeration algorithm, as in [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27], we are able to get a suitable algorithm for the key-recovery task.…”
Section: Introductionmentioning
confidence: 99%