We introduced the concept of public-key deniable encryption explaining for which settings is achievable and for which is not (not achievable in general). We discussed that a public key encryption scheme with perfect correctness cannot deniable so it has to have non-perfect correctness.
Then we presented simple construction of schemes with non-negligible distinguishing advantage (rather than negligible as usual). In particular we presented simple schemes for sender deniability with 1/poly advantage given in Section 3 in this paper (the schemes based on translucent sets and constructions of translucent sets).
Then we said that even though full deniability is in general impossible the researchers found a new clever model called multi-distributional deniability and we started to present this paper. We discussed the philosophical implication of multi-distributional deniability. Then I presented their construction based on simulatable PKE.
We skipped the construction based on bitranslucent sets and we concluded saying that the construction extends easily to the IBE setting. We did not give full proofs for the security but only intuition.
No comments:
Post a Comment