Reputation
7,024
Next tag badge:
87/100 score
22/20 answers
Badges
1 10 30
Newest
 Constituent
Impact
~57k people reached

Jul
3
reviewed Leave Open Easy explanation of “IND-” security notions?
Jul
3
reviewed No Action Needed Using password-based encryption as a hashing scheme
Jul
2
reviewed No Action Needed Relative security of a Vigenère cipher
Jul
2
reviewed No Action Needed Creating a license system based on asymmetric encryption (RSA or ECDSA)
Jun
30
comment Simulation aborted because the adversary doesn't use the random oracle
@cygnusv no you do not need perfect simulation, but if the simulation deviates you need some computational assumption under which the adversary cannot notice the deviation from the perfect simualtion.
Jun
30
comment Proving membership of a group without revealing identity
Did you look into ring signatures or 1-out-of-n signatures?
Jun
30
reviewed No Action Needed Ideas for non duplicate cryptographically secure numbers
Jun
30
reviewed Approve probabilistic-encryption tag wiki
Jun
30
reviewed Approve probabilistic-encryption tag wiki excerpt
Jun
30
comment Partial Homomorphic Schemes that are probabilistic
@sashank ok, I updated my answer accordingly.
Jun
30
revised Partial Homomorphic Schemes that are probabilistic
deleted 37 characters in body
Jun
30
revised Partial Homomorphic Schemes that are probabilistic
added 54 characters in body
Jun
30
answered Partial Homomorphic Schemes that are probabilistic
Jun
29
comment How to multiply two field elements generated by bilinear paring map?
Java has no native support for pairings. So you are obviously using a library and you do not tell us which one. Besides, this is a programming problem and no crypto problem.
Jun
29
reviewed Close Bouncy Castle and Salsa 20
Jun
29
reviewed Close Use curve25519 for ElGamal crypto
Jun
27
awarded  Constituent
Jun
27
comment Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg.
Nice to hear that you enjoy it! :)
Jun
25
comment Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg.
Why do you want to use such a large prime $P$? The size of $P$ is determined by your security parameter and using for instance BN curves for your pairing setting this will be 256 bit for good security. If you want to enlarge the domain of your accumulator you can always use a collision resistant hash function to map arbitrary size strings to elements in $\mathbb{Z}_P^*$.
Jun
25
comment Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg.
I guess you mean the t-SDH based accumulator? Here $P$ is prime and your accumulation domain is $1...P-1$. So this holds for any value in the domain anyways and you do not need to care about that.