The Abe-Okamoto Partially Blind Signature Scheme Revisited
METADATA ONLY
Loading...
Author / Producer
Date
2022
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
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.
Permanent link
Publication status
published
External links
Book title
Advances in Cryptology – ASIACRYPT 2022
Journal / series
Volume
13794
Pages / Article No.
279 - 309
Publisher
Springer
Event
28th International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt 2022)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
09693 - Hofheinz, Dennis / Hofheinz, Dennis
Notes
Conference lecture held on December 9, 2022.
Funding
Related publications and datasets
Is new version of: https://eprint.iacr.org/2022/1232Is previous version of: handle/20.500.11850/610185