# Tag Info

Accepted

### in Bilinear pairings, what is the difference between Type 2 and Type 3?

Note that you do not have an efficiently computable homomorphism from $G_1$ to $G_2$, but in Type-2 you have an efficiently computable homomorphism $\psi: G_2 \rightarrow G_1$ and in Type-3 you do not ...
Accepted

### Is pairing based cryptography ready for productive use?

Type-1 (symmetric pairings) are dead for curves over fields of small characteristic. Over prime fields of large prime characteristic they are not really dead, but as they only offer small embedding ...

### Why do we use groups, rings and fields in cryptography?

Kindly, let me know what was the actual problem which leads us to use groups in cyptogrpahy? Well, we use groups and other similar mathematical constructs because: We found there are problems that ...
Accepted

### Why "pairings on elliptic curve" are used?

Although the question is a bit broad, I think it's an interesting one. Giving a bit of context helps with the explanations. In the 80's, many cryptographic primitives have been design, based on group ...
Accepted

### Pairing on FourQ

The facts you mention regarding the embedding degree show that FourQ is not a pairing-friendly curve, and hence you cannot compute a pairing on it efficiently. Indeed, the representation of group ...
Accepted

### Are pairings still the most efficient implementation for identity and attribute-based encryption?

I am just going to answer regarding identity-based encryption (IBE): I don't know much about the situation for attribute-based encryption. Also, I am just answering based on today's situation: recent ...
Accepted

### Given $g^a, g^b, g^c, g^{1/b}$, is it hard to distinguish $e(g, g)^{abc}$ from a random value?

Your problem seems to be at least as hard as the 2-weak Bilinear Diffie-Hellman Inversion Problem (2-wBDHI problem): Given $g, g^x, g^{x^2}, g^y \in \mathbb G$, and $T \in \mathbb G_T$ to determine ...

### Do I need to prove this?

I purposefully did not look at the details of the change you are proposing because whatever the change is, the answer is a resounding YES. If you make any change to a cryptographic construction, then ...

### Why do we use groups, rings and fields in cryptography?

Groups have properties which are useful for many cryptographic operations When you multiply 2 numbers in a cryptographic operation you want the result of the multiplication also to be in the same set....
Accepted

### Multilinear Pairing in Cryptography

Pairings, or bilinear maps, have indeed found a great deal of applications in crypto; hence, researchers have soon pointed out that further "degrees" of linearity (trilinear maps, etc.) would provide ...
Accepted

### How is it decided if $G_1$ and $G_2$ are two “additive” or “multiplicative” cyclic groups?

Notation is basically a free choice of the author, as they describe functionally the same. And there is no fixed definition for this. However, common practice in mathematical publications is: ...
Accepted

### BN-Curves for 256-bit symmetric security

A BN-curve over a 256-bit prime field $\mathbb{F}_p$ has, being an elliptic curve, a 256-bit group attached to it, say of order $N$. As the best known attacks take $\approx\sqrt{N}$ times, this gives ...

### Are Barreto-Naehrig Curves suitable for pairing-based cryptography?

You can, with the right parameter sizes (384-bit prime instead of the older 256-bit). Pairings can be attacked in two fronts: the elliptic curve or the extension finite field. The security of the ...

### How does Boneh–Lynn–Shacham work?

BLS signatures work in any so called gap group, i.e., a group where the computational version of the Diffie-Hellman (DH) problem - the CDH - is hard, but the decisional version of the DH problem - the ...
Accepted

### pairing-based schemes

Pairings in cryptography is a very important tool, the introduction of which has developed a new field, that is pairing-based cryptography. After the independent pioneering work by Joux and by Sakai ...
Accepted

### Pairing Field size as security parameter

Thats a bit outdated as for your choice of setting (with $k=6$) the 170 bit will give you 1020 bit security in the subgroup of $F_{q^6}^*$. In your case for embedding degree 6 I would at least take ...

### How to compute accumulated values in bilinear map accumulators

In your setting this is assumed to be hard. It is exactly the task of producing a forgery for message $s$ of the weakly secure Boneh-Boyen signature scheme (Sec. 3.1) under public key $g^{e_1}$ (note ...

### How to compare performances of lattice-based and pairing-based IBE schemes

It is very hard to give a concrete, "apples-to-apples" comparison of lattice-based and pairing-based IBE schemes. There are many reasons: the research surrounding concrete secure parameters for LWE ...

### Is the Discrete logarithm problem suitable for this pairing scheme?

First of all, let us simplify the equation by replacing things that the attacker can compute with known constants. We come up with: $$a \cdot b^x = y$$ where the attacker knows $a$ (which is \$e(g,h)...