Pith. sign in

REVIEW 1 cited by

A short note on the paper `Are Randomized Caches Really Random?'

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.00955 v1 pith:2UOEIHJR submitted 2023-04-03 cs.CR cs.AR

Anirban Chakraborty , Sarani Bhattacharya , Sayandeep Saha , Debdeep Mukhopadhyay This is my paper · ORCID
classification cs.CRcs.AR
keywords cachespresentedrandomizedanalyseattackballbucketcache
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this paper, we analyse the results and claims presented in the paper \emph{`Are Randomized Caches Truly Random? Formal Analysis of Randomized Partitioned Caches'}, presented at HPCA conference 2023. In addition, we also analyse the applicability of `Bucket and Ball' analytical model presented in MIRAGE (Usenix Security 2021) for its security estimation. We put forth the fallacies in the original bucket and ball model and discuss its implications. Finally, we demonstrate a cache occupancy attack on MIRAGE with just $10\%$ of total cache capacity and extend the framework to establish a covert channel and a template-based fingerprinting attack.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Random Adaptive Cache Placement Policy

    cs.AR 2025-02 reject novelty 2.0 of 10

    A random eviction plus V-Way hybrid cache reports hit rates on four traces without any baseline comparison.

Pith tools