Abstract
In Africacrypt 2010, Peng and Bao propose a batch proof and verification technique and apply it to design efficient range proof with practical small ranges. Their range proof employs a batch proof and verification technique by Chida and Yamamoto. We show that the batch proof and verification fails in security such that a malicious prover without the claimed knowledge can pass the verification. As a result, there is security concern for the range proof scheme as it may be vulnerable to the attack. However, it is illustrated in this paper that the attack must work under a condition and a simple countermeasure can fail the condition and prevent the attack in the range proof scheme.
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.
