Abstract
In this era, user privacy is a very important issue and encryption is a general solution. However, the encryption technique cannot keep user privacy while the key is leaked under outside coercion. To solve this problem, the deniable encryption technique is a useful tool since it makes the user be able to answer the outside coercer with fake data and proofs. In this paper, we propose a deniable encryption scheme based on the LWE problem (Learning with Errors). We enhance the Regev LWE encryption scheme proposed in 2009 by increasing the probability of decryption failure. So the user can cheat the outsider with the fake message. We also apply the multi-distributional concept proposed by O’Neill et al. scheme to construct our deniable encryption scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
