83 reputation
6
bio website
location
age
visits member for 1 year, 10 months
seen Jan 6 at 7:38

Jul
2
awarded  Curious
Oct
16
comment garbled circuit vs fully homomorphic encryption
I saw this paper, but it's about combining GC, FHE and ABE to achieve FE. Still uncertain if it answers my questions.
Oct
16
revised garbled circuit vs fully homomorphic encryption
added 11 characters in body
Oct
16
asked garbled circuit vs fully homomorphic encryption
Jun
12
accepted Differential privacy definition
Jun
11
asked Differential privacy definition
May
3
awarded  Teacher
Jan
16
comment Why is proof-by-reduction needed (for Elgamal proof of security, for example)?
why don't they have the same distribution? they're both uniform distributions over the same group.
Jan
16
revised Why is proof-by-reduction needed (for Elgamal proof of security, for example)?
edited title
Jan
16
asked Why is proof-by-reduction needed (for Elgamal proof of security, for example)?
Jan
2
answered What are monotonic and non monotonic access structures in ABE ?
Dec
24
awarded  Supporter
Dec
24
accepted Security model for privacy-preserving aggregation scheme.
Dec
21
asked Security model for privacy-preserving aggregation scheme.
Dec
11
asked What are the cryptographic assumptions in the Dolev Yao model?
Dec
10
comment Why are protocols often proven secure under the random oracle model instead of a hash assumption?
I was veering more towards the proof technique in the random oracles. It is not by simply replacing the random oracle with a perfect random function we can arrive at the same proof in the standard model. But what seems troubling to me is the fact that security proof in the random oracle allows the simulator to see the oracle queries made by the adversary. Is there any justification for this? Or is this simply that we cannot do without this assumption?
Dec
9
awarded  Editor
Dec
9
awarded  Scholar
Dec
9
awarded  Student
Dec
7
asked Why are protocols often proven secure under the random oracle model instead of a hash assumption?