The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Convertible Undeniable Signatures
Abstract
We introduce a new concept called convertible undeniable signature schemes. In these schemes, release of a single bit string by the signer turns all of his signatures, which were originally undeniable signatures, into ordinary digital signatures. We prove that the existence of such schemes is implied by the existence of digital signature schemes. Then, looking at the problem more practically, we present a very efficient convertible undeniable signature scheme. This scheme has the added benefit that signatures can also be selectively converted.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Proxy signatures for delegating signing operation
Mambo, M., Usuda, K., & Okamoto, E. (1996) · Proceedings of the 3rd ACM conference on Computer and communications security - CCS '96 · doi:10.1145/238168.238185 · Cited by 584
Proactive public key and signature systems
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266442 · Cited by 253
Metadata
- Authors
- Boyar, J., Chaum, D., Damgård, I., & Pedersen, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-12-03
- Pages
- 189-205
- OpenAlex
- W1590696383
- Cited by
- 167
- References
- 1
- FWCI
- 9.32
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convertible Undeniable Signatures. https://app.cochat.ai/papers/10.1007/3-540-38424-3_14
- The paper
- Boyar, J., Chaum, D., Damgård, I., & Pedersen, T. (2007). Convertible Undeniable Signatures. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-38424-3_14
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
