Abstract
AbstractCertificateless signature and certificate‐based signature are two attractive replacements of regular signature and identity‐based signature because they can alleviate the vexing certificate management problem in regular signatures and can also eliminate the inherent key escrow problem in identity‐based signatures. Although a number of certificateless signatures and certificate‐based signatures from bilinear pairings have been proposed, their lattice‐based counterparts still remain unrealized. In this paper, we present the first constructions of certificateless signature and certificate‐based signature from lattices. Both constructions are proven to be secure in the random oracle model under conventional small integer solution assumption that is as hard as approximating several standard lattice problems. Copyright © 2014 John Wiley & Sons, Ltd.
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.
