Reputation
433
Top tag
Next privilege 500 Rep.
Cast close & reopen votes
Badges
2 12
Impact
~10k people reached

Jun
28
awarded  Notable Question
Mar
17
awarded  Popular Question
Feb
23
revised How to show that a function is not a PRP?
added 287 characters in body
Feb
21
revised How to show that a function is not a PRP?
edited body
Feb
21
comment How to show that a function is not a PRP?
If a truly random permutation is behind the oracle then for the $i$-th query the probability that $w_r=w_a$ is at most $\frac{2^{n-1}}{2^n-i+1}$ which asymptotically converges to $\frac{1}{2}$ and thus the probability for $n$ queries converges to $2^{-n}$. If you agree I'll edit my answer.
Feb
21
comment How to show that a function is not a PRP?
btw,setting 010 wouldn't change it.
Feb
21
revised How to show that a function is not a PRP?
missed the point of the term 'parity-bit'
Feb
21
comment How to show that a function is not a PRP?
you right, I just noticed that parity bit is different thing. Will edit. Thanks
Feb
21
answered How to show that a function is not a PRP?
Feb
13
awarded  Excavator
Feb
13
revised Can we say that if $P=NP$ there is no CPA secure public key encryption?
not a critical change.
Feb
13
suggested approved edit on Can we say that if $P=NP$ there is no CPA secure public key encryption?
Feb
13
comment Can we say that if $P=NP$ there is no CPA secure public key encryption?
In theory of cryptography a polynomial time algorithm does mean fast
Dec
21
comment What is the fixed point attribute of DES (when used with weak-keys)
@IlmariKaronen those links are exactly what I've been looking for :) I've only read the beginning though. You can write it as answer.
Dec
19
asked What is the fixed point attribute of DES (when used with weak-keys)
Dec
13
comment PRG variant as a commitment scheme
In this paper they informally define the plain model as one that provides only authenticated communication channels. Also they show a commitment protocol in that model. I'm not expert in commitments nor in the plain model and probably the argument you mentioned above is more general. Back to my question, I'm interesting in an efficient commitment scheme even if it relies on one-way-function, by efficient I mean that it is non-interactive and can treat an entire bit-string at once with low-cost (like a PRG/PRF).
Dec
11
comment PRG variant as a commitment scheme
I'm not sure that I understand you last comment, by "plain model" you mean that there does not exist a proven commitment scheme that is not relying on some assumption? (like one-way-function)
Dec
11
comment PRG variant as a commitment scheme
Thanks for the reference, this is too theoretically though. I'm looking for more practical/simple/efficient use of PRG, I mean that that the protocol is non-interactive - the only message is from the sender (committer) to the receiver , and the committed value is a bit-string rather than one bit.
Dec
11
asked PRG variant as a commitment scheme
Dec
9
comment Hamiltonicity proof of knowledge
*definition is copied word for word..