Abstract
The paper has proposed a grouping-proof protocol that can conduct parallel processing, specific to the problem of low generation efficiency of the grouping-proof protocol of the existing RFID grouping proof scheme, based on the dif- ficulty of the elliptic-curve discrete logarithm, by analyzing the insufficiency of the existing grouping-proof protocol de- sign proposal. Besides, the paper has described the presented grouping-proof protocol, and proved it from security, cor- rectness and privacy. The analysis shows that, the proposal can meet security and privacy requirements, and has higher security and lower tag calculation complexity compared with the similar protocols.
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.
