Recent Advances in Randomness Extraction by Eshan Chattopadhyay

Subjects: “…randomness extractor…”
Get full text

A Concrete LIP-Based KEM With Simple Lattices by Gustavo de Castro Biage, Gustavo Zambonin, Thais B. Idalino, Daniel Panario, Ricardo Custodio

“…In this work, we propose the first instance of such a KEM, following the framework of Ducas and van Woerden (EUROCRYPT 2022), using simple lattices. We present a randomness extractor derived from a hash function based on the short integer solution problem; define a concrete set of parameters for instantiating the scheme; provide a rigorous security estimation of an attacker trying to decode an encapsulated key through reductions to hard lattice problems; and use well-known methods to convert the IND-CPA secure KEM into an IND-CCA2 secure KEM, comparing the latter with other modern lattice-based KEMs. …”
Get full text

A CCA-PKE Secure-Cryptosystem Resilient to Randomness Reset and Secret-Key Leakage by Alfonso Labao, Henry Adorna

“…In this paper, we attempt to address this problem of a joint combination of randomness and secret-key leakage attacks through two cryptosystems that incorporate hash proof system and randomness extractor primitives. The first cryptosystem relies on the random oracle model and is secure against a class of adversaries, called non-reversing adversaries. …”
Get full text

Topics in additive combinatorics by Mrazovic, R

“…</p> <p>In Chapter 3 we prove that a randomly chosen subset of a finite group is a randomness extractor with high probability. More precisely, we prove that for every fixed δ &gt; 0, given a finite group <em>G</em> and <em>A</em> ⊂ <em>G</em> a random subset of density 1/2, we prove that with high probability for all subsets &amp;vert;X&amp;vert; &amp;vert;Y&amp;vert; ≥ log^2+δ &amp;vert;G&amp;vert; for ( 1/2 + o(1))&amp;vert;X&amp;vert; &amp;vert;Y&amp;vert; of the pairs (<em>x; y</em>) ∈ X × Y we have <em>xy</em> ∈ <em>A</em>.…”

The method of multiplicities by Saraf, Shubhangi

Get full text

Kakeya sets and the method of multiplicities by Saraf, Shubhangi

Get full text

Algebraic methods in randomness and pseudorandomness by Kopparty, Swastik

Get full text

Maintaining secrecy when information leakage is unavoidable by Smith, Adam (Adam Davidson), 1977-

Get full text

Extensions to the method of multiplicities, with applications to Kakeya sets and mergers by Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, Sudan, Madhu

“…-bits long, which significantly improves upon previous construction of mergers. 3) We show how to construct randomness extractors that use logarithmic length seeds while extracting 1 - o(1) fraction of the min-entropy of the source. …”
Get full text

Sparse graph codes for compression, sensing, and secrecy by Chandar, Venkat (Venkat Bala)

Get full text