# Tag Info

### Choosing asymmetric pairing for Elliptic Curves

Not all elliptic curves are suitable for use with pairings - you need to choose a pairing-friendly curve. There are several families of pairing-friendly curves; one of these is the set of Barreto-...
• 424
1 vote
Accepted

### Quantum secure algorithms

I want to know if the below algorithm , secure against quantum computing attack No, it's not secure against Quantum Computers. To quote the text: the secret key is $sk = x \in_R \mathbb{Z}_p$ and ...
• 135k
1 vote

### Choosing asymmetric pairing for Elliptic Curves

Let's start from the beginning. We have symmetric encryption, an AES128 for example is said to have a security level $128$ because we need $2^{128}$ operations to recover the key (brute force). ...
1 vote

### Choosing asymmetric pairing for Elliptic Curves

There are slim chances to "just choose proper $G_2$". There are families of specific curves such that $G_2$ will have proper number of points. Supersingular curves with $(p+1)$ points for the curve ...
• 2,237
1 vote

### Provable data possession (PDP) VS Merkle tree

I'd say that like with the naive variant of simply asking for the hash of the data, the server can just throw away the data and store the hashes and still answer queries. It is important for such ...
• 12.2k
1 vote
Accepted

### Updating values authenticated by Merkle Tree

What do you mean that you keep the root of the merkle tree locally? Is the merkle tree signed? If i understand what you are saying correctly, then the server can choose not to display to the public ...
• 357
1 vote

### Proof of Knowledge/Data Integrity using Hash Function

From your question, I believe that what you are looking for is a proof of storage. I will point you in the direction of one paper, and you can use that to look for other work on the topic.

Only top scored, non community-wiki answers of a minimum length are eligible