## CryptoDB

### Paper: The Abe-Okamoto Partially Blind Signature Scheme Revisited

Authors: Julia Kastner , Department of Computer Science, ETH Zurich Julian Loss , CISPA Helmholtz Center for Information Security Jiayu Xu , School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA Search ePrint Search Google Slides ASIACRYPT 2022 Partially blind signatures, an extension of ordinary blind signatures, are a primitive with wide applications in e-cash and electronic voting. One of the most efficient schemes to date is the one by Abe and Okamoto (CRYPTO 2000), whose underlying idea - the OR-proof technique - has served as the basis for several works. We point out several subtle flaws in the original proof of security, and provide a new detailed and rigorous proof, achieving similar bounds as the original work. We believe our insights on the proof strategy will find useful in the security analyses of other OR-proof-based schemes.
##### BibTeX
@inproceedings{asiacrypt-2022-32677,
title={The Abe-Okamoto Partially Blind Signature Scheme Revisited},
publisher={Springer-Verlag},
author={Julia Kastner and Julian Loss and Jiayu Xu},
year=2022
}