Abstract
ABSTRACT In this paper, two polar code-based identification schemes are proposed in which the polar codes are used instead of random codes. The security of the proposed identification schemes is based on the hardness of coding problems such as general decoding problem (GDP) and syndrome decoding problem (SDP). By exploiting the properties of polar codes in the proposed identification schemes, it does not need to save the parity check or generator matrix of polar codes completely as a public data. Therefore, the public data size of the proposed identification schemes is reduced up to 90% in comparison with the Stern and Veron identification schemes. Also, by using the efficient techniques of seed generation and compression, it is shown that the communication costs of the proposed identification schemes are reduced up to 53% compared to the Stern and Veron identification schemes. Moreover, security analyses show that the proposed identification schemes have low cheating probability and also have proper resistance against information set decoding attack.
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 callMore From: Information Security Journal: A Global Perspective
Disclaimer: 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.
