# Tagged Questions

Pairing-based cryptography uses bilinear maps to create a gap group that allows efficient constructions of certain primitives.

16 views

### jpbc Element compare [on hold]

I want to compare an element of jpbc.Element produced with another element,produced later.If am inserting the first element to mysql db ,which datatype i will use for an element of type {x=...
36 views

### Found weil pairing. Index Calculus method on the results of weil pairing

Consider Elliptic curve with p = 59, A = 1, B= 0, P = (25,30) and Q=(35,31). So I tried to solve this using MOV attack. The torsion point for them E[5] is R(-25,30i) where is sqroot -1 Chosen two ...
76 views

### tripartite diffie hellman with Weil pairing

I try to understand how the tripartite Diffie-Hellman key exchange works. I read Joux's paper for this: https://www.semanticscholar.org/paper/A-One-Round-Protocol-for-Tripartite-Diffie-Hellman-Joux/...
40 views

### BDH Problem or Guessing Problem or Discrete Logarithmic Problem

In identity-based encryption, $P\in G1,s\leftarrow Z_{q}, Pub=sP$, Given $P,Pub$ Finding $s$ value, by repeatedly generating random $x$ value. Checking whether estimated value $EstPub=xP$ is ...
35 views

### Secret Key Encryption in identity based encryption

If we assume $x$ be secret value $x\leftarrow{0,1,2,....,q-1}$ where q is a prime number Instead of using public key encryption schemes, using a function such as $f(x)=x*y/z$ to conceal $x$ value ...
28 views

### Boneh/Franklin Identity based encryption with Tate pairing

Boneh/Franklin developed an identity based encryption scheme based on the Weil Pairing. This algorithm has also been standardised in IEEE P1363.3 . I know that this algorithm can also be implemented ...
35 views

### Has anybody implemented BGN cryptosystem to multiply two plain texts?

I have tried to use this code as follows, http://stackoverflow.com/questions/33581962/bgn-implementation-in-java but the issue is, when it generate the pairing, the output is in GTfiniteelement (for ...
47 views

### Weil Pairing - Miller's Algorithm

I'm trying to implement Weil Pairing using Miller's algorithm. I have got couple of questions. How to select $m$? As stated in this link page 13, I interated from $1$ to order of point $P$ such that ...
77 views

53 views

### Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg.

Is there any restriction that the members to be accumulated in bilinear map (multiplicative) accumulator need to be relatively prime to P? Where P is the order of group.
75 views

### What is more efficient, pairing based cryptography or non pairing based cryptography? [closed]

As far as I know non pairing pairing based cryptography is less time consuming than pairing based because, pairing based uses complex operations. Are there any advantages of pairing based cryptography ...
66 views

### Anyone familiar with domain of hash functions in bilinear pairing based system?

I need a clarification regarding domain of hash functions. I have defined a bilinear pairing based system as follows: Let G1 and G2 be cyclic multiplicative groups of prime order p generated by g1 ...
69 views

### Bilinear pairing arithmetic - cryptographic accumulators

For calculating accumulated values for set of elements chosen randomly from say ${ e_1 ,e_2,...e_n}\varepsilon X$ we use the formula $acc= g^{f(e,s)}$ where $f(e,s)= (e_1+s)(e_2+s).....(e_n+s)$ ...
96 views

### Bilinear pairing arithmetic

Is this $e(g^x,g^yH^z) = e(g^x,g^y)e(g^x,H^z)$ expression is true? where $g$ is the generator and $H \in G$
270 views

Let : $G_{0}$ and $G_{1}$ be two multiplicative cyclic groups of prime order $p$, $g$ be a generator of $G_{0}$ and $e$ be a bilinear map, $e : G_0 \times G_0 → G_1$ and let $𝐶_{1} = 𝑔^{𝛽𝑠_{1}... 1answer 79 views ### Bilinear map + commitment Let$\mathbb{G}_1,\mathbb{G}_2,\mathbb{G}_T$be yclic group of the same order and$ e: \mathbb{G}_1 \times \mathbb{G}_2\rightarrow \mathbb{G}_T$, such that$u\in \mathbb{G}_1, g \in \mathbb{G}_2, a,b,...
How to compute $g^{1/(e_1+s)}$, where $g$ is the generator of group $\mathbb G$, and $e_1$ and $s$ are keys? I know only $s$ and $g^{e_1}$, not $e_1$. $\mathbb G$ has prime order for some prime $p$ ...