Get Rid of Templates: A Chosen-Ciphertext Attack on ML - KEM with a DPA -Based Self-comparison Oracle

Zhenzhi Lai, Udaya Parampalli · DOI 10.1007/978-981-96-9098-5_10

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.CC · 2026-06-19 · unverdicted · novelty 6.0

Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.

Showing 1 of 1 citing paper after filters.

Towards a Doubly Efficient IP=PSPACE cs.CC · 2026-06-19 · unverdicted · none · ref 37
Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.