Questions tagged [negligible]

Negligible normally means that something is so unimportant, that it isn't worth considering. In cryptography, a function of a parameter $n$ is negligible if converges to $0$ faster than $1/n^c$ for any constant $c>0$.

Negligible means that something is so unimportant, that it isn't worth considering. For example, if a flaw in a cryptographic algorithm is considered to be negligible, it is insignificant to both the algorithm as well as it's security.

In the complexity-based modern cryptography, a security scheme is provably secure if the probability of security failure (e.g., inverting a one-way function, distinguishing cryptographically strong pseudorandom bits from truly random bits) is negligible in terms of the cryptographic key length $n$. That is: the probability of success of the adversary (or their advantage in some experiment) is a negligible function of $n$.

A function $f:\mathbb R\to\mathbb R$ is negligible iff $\forall c>0$, $\exists N$ such that $\forall n>N$ it holds $|f(n)|<n^{-c}$.

35 questions
29
votes
2 answers

What exactly is a negligible (and non-negligible) function?

The mathematical definition of neglible and non-neglible functions is fairly clear-cut, but why they are important and how they are used in cryptography?
Nico Bellic
  • 525
  • 2
  • 5
  • 8
12
votes
3 answers

How small is negligible?

When proving theorems in crypto we often make use of the concept of negligible functions or, more simply, negligible parameters. As a rule of thumb, given today (2018) computational power, what is the smallest inverse power of 2 that we can consider…
Rexcirus
  • 333
  • 3
  • 14
5
votes
2 answers

Property of negligible functions

Suppose that $\mu(n)$ is a negligible function, which means that for every $c>0$ there is some $N$ such that for all $n>N$ it holds that $\mu(n)\leq n^{-c}$. Now, imagine that some encryption scheme, signature scheme, or some cryptographic…
Daniel
  • 4,102
  • 1
  • 23
  • 36
5
votes
1 answer

What does "overwhelming" mean in cryptography?

I found the term "overwhelming" when I study cryptography. According to the definition, we call $f$ overwhelming if $1-f$ is negligible. I already know the negligible function and its way to use but I don't understand why we consider the…
iomat
  • 163
  • 4
5
votes
1 answer

Differential Privacy: why $\delta$ negligible on the row numbers?

The definition of differential privacy says that an algorithm $M$ is $(\epsilon,\delta)$-differentially private if $$P(M(x \in D) \in S)\leq e^\epsilon P(M(x \in D')\in S) + \delta$$ where $D,D'$ differ by one row and $\delta$ is …
4
votes
1 answer

Unpacking the definition of negligible & non-negligible

There are several threads on this topic including: How is an epsilon of 1/1000 non-negligible? How to calculate if probability is negligible or not (and others) but I do not fully understand the answers in those threads. My question is: I would…
Max
  • 417
  • 1
  • 6
  • 11
4
votes
1 answer

Overwhelming implies non-negligible

Is it true that an overwhelming function should be non-negligible? Recall that a function $f$ is overwhelming if $1-f$ is negligible, and a function $g$ is negligible if there exists an $N$ such that for all $n>N$, we have $|g(n)|<\frac{1}{n^c}$ for…
3
votes
1 answer

When truncating an AES MAC value by "w" , how do I justify that "w" is still negligible?

I'm taking an online class on cryptography at corsera.org / Stanford, and the professor is explaining that it's OK to truncate an AES MAC to $w$ bits as long as $1/2^w$ is still negligible (say $w > 63$) Where did the value $1/2$ come from? How is…
makerofthings7
  • 2,631
  • 1
  • 22
  • 37
3
votes
1 answer

Polynomial sum of negligible functions need not be negligible

Let $\{\epsilon_i\}_{n \in \mathbb{N}}$ be a sequence of negligible functions and $q(n)$ be a polynomial in $n$. Then $f(n) = \sum_{i = 1}^{q(n)} \epsilon_i(n)$ need not be a negligible function. Ideas A typical negligible function is $2^{-n}$.…
user1868607
  • 1,243
  • 12
  • 29
3
votes
2 answers

Proving that a function is negligible

My question is about proving that a function is negligible if it is ran polynomial number of times. This my solution: By the definition of negligibility, we have $negl_1(n) < 1/p'(n)$ where $p'(n)$ is any polynomial. We multiply $p(n)$ both…
Mitch
  • 31
  • 2
3
votes
2 answers

How to calculate if probability is negligible or not

If i have probability $Q = 2C(A\times B)$ where $A$ and $B$ are unknown probabilities and $C$ is a non-negligible probability, what can i speculate about probability $Q$ and how can i calculate bounds on probabilities $A$ and $B$ in order to make…
henry
  • 33
  • 1
  • 3
3
votes
1 answer

Is $q(n)=1/n$ a negligible function?

By definition - $q(n)$ is a negligible function if for every positive integer $c>0$ there exist an integer $N_c$ such that for all $x>N_c$ : $q(n)<1/x^c$ So for the function $1/x$, if we take the positive integer $c=1$ then we need to find some…
Bush
  • 2,160
  • 3
  • 18
  • 27
3
votes
1 answer

What are not non-negligible functions?

I had a brief look at "On Defining Proofs of Knowledge" by Bellare and Goldreich and I am a little confused by their definitions. I was under the impression a negligible function $f$ was defined as something like $$\forall\ polynomials\ p\ \exists…
Elias
  • 4,933
  • 1
  • 16
  • 32
2
votes
1 answer

GetModulus negligible probability

I have this textbook definition, I shall include below. GenModulus denotes a ppt algorithm that, on input $1^n$, outputs $(N, p, q)$ where $N = p\,q$ and (except with negligible probability) $p$ and $q$ are $n$-bit primes. A few pages back in the…
2
votes
2 answers

Identifying negligible functions

I am having a hard time understanding and applying the formulas that are used to identify a function is negligible or not? One text defines it as; a function $f$ from the natural numbers to the non-negative real numbers is negligible if for every…
ron
  • 51
  • 1
  • 3
1
2 3