Abstract
There is a great demand for publicly verifiable encryption in key escrow,optimistic fair exchange,publicly verifiable secret sharing and secure multiparty computation,but the current schemes are either chosen plaintext secure or chosen ciphertext secure in the random oracle model,which obviously are not secure enough to be applied in the complicated circumstances.Based on the analysis of the current schemes and application of the reality,this paper proposed a new publicly verifiable encryption scheme by combining the CS encryption scheme with the non-interactive zero knowledge proof protocol.The new scheme enabled any third party other than the sender and receiver to verify the validity of the ciphertext,but leaked no information about the message.Finally,without using the random oracle,the adaptively chosen ciphertext security of the scheme is proved in the standard model.
Sign-in/Register to access full text options 
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.
