Reputation
Next privilege 125 Rep.
Vote down
Badges
5
Newest
 Supporter
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 6 votes cast
Jan
27
revised LR-Oracle Experiment in Lindell and Katz
added 35 characters in body
Jan
27
comment LR-Oracle Experiment in Lindell and Katz
Questions (1) and (2) have been answered by @Yehuda Lindell in the comments section of the answer to this post: crypto.stackexchange.com/questions/32181/…
Jan
27
revised LR-Oracle Experiment in Lindell and Katz
added 3 characters in body
Jan
27
comment Encryption Oracle Avoidance
A couple of questions: (1) Is it safe to assume that its OK to provide an encryption oracle to a CPA adversary so long as the encryption scheme $\pi$ has the property that for multiple encryptions $Pr[PrivK^{LR cpa}_{\mathcal{A},\pi}(n)=1]≤1/2+negl(n)$ (in the notation of Lindell and Katz),i.e, its safe to provide an oracle so long as the scheme is CPA secure for multiple encryptions, (2)If not, what is the exact definition that tells me when it's secure to expose an encryption oracle to a CPA adversary (3)for a CPA secure scheme, adding authentication additionally provides CCA security ?
Jan
27
revised LR-Oracle Experiment in Lindell and Katz
added 1 character in body
Jan
27
revised LR-Oracle Experiment in Lindell and Katz
added 77 characters in body
Jan
27
revised LR-Oracle Experiment in Lindell and Katz
added 36 characters in body
Jan
27
revised LR-Oracle Experiment in Lindell and Katz
added 36 characters in body
Jan
26
asked LR-Oracle Experiment in Lindell and Katz
Jan
26
accepted Encryption Oracle Avoidance
Jan
26
asked Encryption Oracle Avoidance
Jan
18
revised Contrasting Key Rotation Requirements : Asymmetric vs. Symmetric Ciphers
added 74 characters in body
Dec
28
accepted Contrasting Key Rotation Requirements : Asymmetric vs. Symmetric Ciphers
Dec
26
comment Contrasting Key Rotation Requirements : Asymmetric vs. Symmetric Ciphers
CBC would require the block cipher be a PRP since invertiblity is a requirement for this mode. You seem to imply that a proof of the CBC theorem relies on results around the birthday problem, would you have a reference to the actual proof. As @Ritchie Frame implies the situation is fundamentally different for RSA-OAEP since the attacker holds the encrypting key and is in some sense her own encrypting oracle, able to produce an unlimited number of cipher texts... A system like this could not require a bound be placed on the number of encryptions under a public given key...
Dec
23
asked Contrasting Key Rotation Requirements : Asymmetric vs. Symmetric Ciphers
Oct
21
comment Why can't Homomorphic encryption schemes support algorithms with conditions/branching?
BTW on a related note around homomorphic comparisions, there is a description by Shai that sketches out a way to compute an encryption of a bit that is 1 if the comparision is true and 0 otherwise -github.com/shaih/HElib/issues/45
Oct
21
awarded  Supporter
Oct
21
accepted Homomorphic Encryption - Smart Vercauteren Batching
Apr
4
comment Homomorphic Encryption - Smart Vercauteren Batching
Regarding question (2), I would restate it as: Is what is meant by $\mathbb{Q}(\theta) = \mathbb{Q}[X]/(F)$ the field $\mathbb{Q}(\theta)$ created by adjoining $\theta$, a root of $F(X)$ in the algebraic closure of $\mathbb{F}_2$, to $\mathbb{Q}$?
Apr
4
awarded  Editor