Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Generic Constructions For Universal Designated-Verifier Signatures And Identity-Based Signatures From Standard Signatures, S. F. Shahandashti, R. Safavi-Naini
Generic Constructions For Universal Designated-Verifier Signatures And Identity-Based Signatures From Standard Signatures, S. F. Shahandashti, R. Safavi-Naini
Faculty of Informatics - Papers (Archive)
We give a generic construction for universal designated-verifier signature schemes from a large class, C, of signature schemes. The resulting schemes are efficient and have two important properties. Firstly, they are provably DV-unforgeable, non-transferable and also non-delegatable. Secondly, the signer and the designated verifier can independently choose their cryptographic settings. We also propose a generic construction for identity-based signature schemes from any signature scheme in C and prove that the construction is secure against adaptive chosen message and identity attacks. We discuss possible extensions of our constructions to hierarchical identity-based signatures, identity-based universal designated verifier signatures, and identity-based ring signatures …
Codes Identifying Bad Signatures In Batches, J. Pastuszak, J. Pieprzyk, Jennifer Seberry
Codes Identifying Bad Signatures In Batches, J. Pastuszak, J. Pieprzyk, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
The work is concerned with identification of bad signatures in a sequence which is validated using batching. Identification codes (id-codes) are defined and their general properties are investigated. A taxonomy of id-codes is given. The generic construction for a wide range of id-codes is given and its instantiation using mutually orthogonal Latin squares is described. Hierarchical identification is studied for two cases when the identification procedure uses a family of id-codes and when there is a single underlying id-code. Remarks about future research conclude the work.
Identification Of Bad Signatures In Batches, J. Pastuszak, D. Michalek, J. Pieprzyk, Jennifer Seberry
Identification Of Bad Signatures In Batches, J. Pastuszak, D. Michalek, J. Pieprzyk, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
The paper addresses the problem of bad signature identification in batch verification of digital signatures. The number of generic tests necessary to identify all bad signatures in a batch instance, is used to measure the efficiency of verifiers. The divide-and-conquer verifier DCVα(x,n) is defined. The verifier identifies all bad signatures in a batch instance x of the length n by repeatedly splitting the input into α sub-instances. Its properties are investigated. In particular, probability distributions for the number of generic tests necessary to identify one, two and three bad signatures, are derived. The average numbers of GT tests necessary to …