Reputation
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
3 11 24
Impact
~94k people reached

18m
asked Leaking the difference of an encrypted vector
9h
awarded  Famous Question
1d
revised What is the time requirement for pairing computation and modular exponentiation?
added 166 characters in body
1d
comment What is the notion of an interactive assumption?
Also comparing CPA with DDH is like comparing apples and oranges...Isn't it? CPA maybe secure because internally the attacker cannot solve ddh for instance. So we can't really compare them i think
1d
comment What is the notion of an interactive assumption?
If at some point of your protocol there is an instance of exactly equivalent well known assumption (e.g: DDH), then during the proof the argumentation is "this is an instance of a well-known assumption" and the proof is over? Or you have to instantiate an attacker who is given an instance to the well known problem and he will use attacker A of the scheme to solve his problem? But this is difficult when we are talking about the same assumptions, because the instance of problem B is given should much with that of A.
1d
answered What is the time requirement for pairing computation and modular exponentiation?
Feb
5
revised What is the difference between MAC and HMAC?
deleted 2 characters in body
Jan
17
comment Proof of non-membership on a merkle tree
Lets take the example in Fig 1. The set comprises of 3 elements. How you prove that 1111 is not there?I do not think that it is supported. So there is a restriction on the type of non-membership queries
Jan
17
comment Proof of non-membership on a merkle tree
How the trees are on the size of the data set? Let's say the universe has size |n| and my dataset is of size |d|. Then the membership tree has 2^|n| leaves. And includes the membership tree and the non-mebership one. This the way it is described i think in the paper with the frontier one. They first construct a complete tree of k levels, where k is the size of the hash digest
Jan
17
comment Proof of non-membership on a merkle tree
Ok, but i still can't see according to the document how you can prevent an attacker of proving a non-membership for an item that actually exists in the merkle tree. Instead of returning the asking H(x) and the path, it returns H(x') and H(x'') which are the before and after nodes
Jan
16
comment Proving pseudorandom generators
how your ideas proceed with hybrid arguments?
Jan
15
comment Proof of non-membership on a merkle tree
Still that assumes you are making a Merkle tree with all the universe in it. All possible ranges.
Jan
15
answered Is it safe to use XOR to encrypt data key using master key
Jan
15
comment Proof of non-membership on a merkle tree
I know about accumulators. My problem is their non-standard q-ary assumptions they are based on.
Jan
14
comment Proof of non-membership on a merkle tree
That seems to kill the nice property of efficient verification of the dataset, since the user has to keep track of all the leaves
Jan
14
comment Proof of non-membership on a merkle tree
It seems a bit not efficient if i have to construct a tree with data not in the first tree. It seems like i have to construct a huge tree for the uninerse-my data
Jan
14
asked Proof of non-membership on a merkle tree
Dec
27
revised Exchanging encrypted messages, and decrypting without a public key?
added 197 characters in body
Dec
27
answered Exchanging encrypted messages, and decrypting without a public key?
Dec
27
revised What is the main difference between a key, an IV and a nonce?
deleted 1 character in body