All reports by Author Divesh Aggarwal:

__
TR24-061
| 5th April 2024
__

Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi#### Improved Lower Bounds for 3-Query Matching Vector Codes

__
TR21-090
| 14th June 2021
__

Divesh Aggarwal, Eldon Chung, Maciej Obremski, Joao Ribeiro#### On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing

__
TR19-173
| 28th November 2019
__

Divesh Aggarwal, Siyao Guo, Maciej Obremski, Joao Ribeiro, Noah Stephens-Davidowitz#### Extractor Lower Bounds, Revisited

Revisions: 1

__
TR15-179
| 10th November 2015
__

Divesh Aggarwal, Kaave Hosseini, Shachar Lovett#### Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification

__
TR14-129
| 10th October 2014
__

Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana , Maciej Obremski#### Leakage-resilient non-malleable codes

Revisions: 1

__
TR14-128
| 10th October 2014
__

Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana , Maciej Obremski#### Non-malleable Reductions and Applications

Revisions: 3

__
TR13-081
| 6th June 2013
__

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett#### Non-malleable Codes from Additive Combinatorics

__
TR13-076
| 15th May 2013
__

Divesh Aggarwal, Chandan Dubey#### Improved hardness results for unique shortest vector problem

Revisions: 1

Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi

A Matching Vector ($\mathbf{MV}$) family modulo a positive integer $m \ge 2$ is a pair of ordered lists $\mathcal{U} = (\mathbf{u}_1, \cdots, \mathbf{u}_K)$ and $\mathcal{V} = (\mathbf{v}_1, \cdots, \mathbf{v}_K)$ where $\mathbf{u}_i, \mathbf{v}_j \in \mathbb{Z}_m^n$ with the following property: for any $i \in [K]$, the inner product $\langle \mathbf{u}_i, \mathbf{v}_i \rangle ... more >>>

Divesh Aggarwal, Eldon Chung, Maciej Obremski, Joao Ribeiro

Secret-sharing is one of the most basic and oldest primitives in cryptography, introduced by Shamir and Blakely in the 70s. It allows to strike a meaningful balance between availability and confidentiality of secret information. It has a host of applications most notably in threshold cryptography and multi-party computation. All known ... more >>>

Divesh Aggarwal, Siyao Guo, Maciej Obremski, Joao Ribeiro, Noah Stephens-Davidowitz

We revisit the fundamental problem of determining seed length lower bounds for strong extractors and natural variants thereof. These variants stem from a ``change in quantifiers'' over the seeds of the extractor: While a strong extractor requires that the average output bias (over all seeds) is small for all input ... more >>>

Divesh Aggarwal, Kaave Hosseini, Shachar Lovett

The study of seeded randomness extractors is a major line of research in theoretical computer science. The goal is to construct deterministic algorithms which can take a ``weak" random source $X$ with min-entropy $k$ and a uniformly random seed $Y$ of length $d$, and outputs a string of length close ... more >>>

Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana , Maciej Obremski

A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the \emph{leakage} attacks in which the adversary obtains some information about the internal state of the machine, and the \emph{tampering} attacks where the adversary can modify this ... more >>>

Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana , Maciej Obremski

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs~\cite{DPW10}, provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained in a modified codeword is either ... more >>>

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett

Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a ... more >>>

Divesh Aggarwal, Chandan Dubey

We give several improvements on the known hardness of the unique shortest vector problem in lattices, i.e., the problem of finding a shortest vector in a given lattice given a promise that the shortest vector is unique upto a uniqueness factor $\gamma$.

We give a deterministic reduction from the ...
more >>>