Skip to main content
The 2026 Annual Developer Survey is live— take the Survey today!.

Questions tagged [cryptography]

Ask Question

The tag has no summary.

19 questions
Newest Active Bountied Unanswered

Question list filters

Filter by
Sorted by
Tagged with
Filter by Employee ID
Score of 1
0 answers
136 views

I've been looking for answers to this but I wasn't able to find any references. Of course OWFs existing implies $P \neq NP$, but what about the stronger $E \neq NE$ or $EXP \neq NEXP$? Is this an open ...
Score of 2
1 answer
263 views

I've been sort of thinking about $C^{poly}$ witnesses for a certain reason for several years and sort of weaker senses of reductions of problems in the back of my mind, but I just recently saw results ...
Score of 0
0 answers
89 views

Consider the following problem: we have two parties: Alice and Bob Alice has some sensitive data D (for Data) that she does not want to reveal to Bob Bob has some sensitive code C (for Code) that he ...
Score of 1
0 answers
114 views

I am reading a research paper where multiple times the authors use the following, which they claim follows from an averaging argument. Claim: Suppose $\mathcal{X}$ and $\mathcal{Y}$ are two finite ...
Score of 4
1 answer
701 views

I'm dipping my toes into lattice-based cryptography, but the difference between the SVP and CVP confuses me. I'm most definitely missing something big here, but I still couldn't figure it out, so I'm ...
Score of 4
0 answers
73 views

Consider a random system of degree-$d$ polynomials, with $n$ variables and $m$ equations, over some finite field $\mathbb{F}_q:$ $$\begin{align}\sum_{\substack{(\alpha_1,\dots,\alpha_n) \in \mathbb{Z}...
Score of 3
0 answers
113 views

Fully black-box reduction is defined as in Notions of reducibility between crytpographic primitives, O. Reingold et al. Error-correcting code is used in the black-box abstract way in the sense that ...
Score of 3
0 answers
93 views

A standard method of constructing pairwise independent hash function from error-correcting code is as follows: Given a generator matrix $G$ of a distance-$d$ linear error-correcting code mapping $m$ ...
Score of 5
1 answer
116 views

I have proved that there exist such reduction between error-correcting codes and exposure resilient functions, which is because that the transpose of a generator matrix for a ERC mapping $\mathbb{F}_2^...
Score of 3
0 answers
46 views

We have lower bounds for classical zero-knowledge protocols (eg we cannot have 3-round zero-knowledge protocols for NP, with negligible soundness and black-box simulation). However, some of these ...
Score of 2
0 answers
86 views

I am looking for interesting examples of complexity-theoretic and cryptographic problems where we have a significant amount of knowledge about the classical version of the problem, but we have no ...
Score of 2
1 answer
110 views

Let $F_x : \{0;1\}^n \rightarrow \{0;1\}$ be a family of polyomially sized DNF (with respect to $n$). The key $x$ lives in $\{0;1\}^{\lambda(n)}$, $\lambda(n)$ is polynomially bounded in $n$. Can such ...
Score of 1
1 answer
143 views

Cryptosystems that are based on error correcting codes are often based with hardness of the two problem. Computational syndrome decoding is hard Indistinguishability Assumption (IA): Distinguishing ...
Score of 0
1 answer
115 views

This question is based on the paper- https://arxiv.org/abs/1703.08508. As far as I understand, for this proof Vidick uses a quantum parallel repetition for 3 player- Alice, Bob and Eve but the results ...
Score of 1
1 answer
266 views

I'll preface this question by saying I have very little (zero!) knowledge of theoretical computer science, and this post is a genuine attempt to understand something, even if at an intuitive level, ...

15 30 50 per page
1
2