DGMT: A Fully Dynamic Hash-Based Group Signature
| dc.contributor.advisor | Safavi-Naini, Reihaneh | |
| dc.contributor.author | Erfanian Azad Soltan, Aylar | |
| dc.contributor.committeemember | Yanushkevich, Svetlana | |
| dc.contributor.committeemember | Henry, Ryan | |
| dc.date | 2023-11 | |
| dc.date.accessioned | 2023-07-07T16:01:10Z | |
| dc.date.available | 2023-07-07T16:01:10Z | |
| dc.date.issued | 2023-07 | |
| dc.description.abstract | With the rapid development of quantum technologies, quantum-safe cryptographic schemes have found significant attention. Shor’s quantum algorithms for breaking discrete logarithm (DL) and integer factorization (IF) problems will bring depredation for currently used public key algorithms, including RSA (Rivest–Shamir–Adleman), DH (Diffie-Hellman) key agreement, DSA (Digital Signature Algorithm) and ECC (Elliptic Curve Cryptography), which their security depends on solving mathematical hard problems (IF and DL problem). Therefore, applications and protocols must evolve to be quantum secure in the presence of quantum computers. It is believed that symmetric encryptions and hash functions are resilient to attacks by a quantum adversary. Therefore, signature schemes have been modified so that their security relies on hash functions instead of the aforementioned mathematical hard problems. In this thesis, we consider post-quantum digital group signatures, whose security depends on one-way functions. In practice, these functions are replaced by cryptographic hash functions, which are expected to remain secure in the presence of quantum computers. A group signature is a signature scheme that allows a group member to anonymously sign messages on behalf of the group, while anonymity can be annulled by an opening authority or group manager. In fully dynamic group signature schemes, new members can be added to the group after the initialization phase and existing members can be revoked from the group. The primary aim of this thesis is twofold. Firstly, it aims to conduct a comprehensive analysis of various hash-based group signature schemes, taking into consideration their security models, properties, and limitations. Moreover, this thesis contributes to the development of a novel fully dynamic group signature scheme, named DGMT, which addresses the limitations of previous schemes, and we prove its security (unforgeability, anonymity, and traceability), and provide the complete implementation of the this scheme for the first time. Secondly, the thesis intends to review and evaluate various revocation methods with the objective of identifying potential ways to improve the revocation method utilized in the proposed scheme. | |
| dc.identifier.citation | Erfanian Azad Soltan, A. (2023). DGMT: a fully dynamic hash-based group signature (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. | |
| dc.identifier.uri | https://hdl.handle.net/1880/116712 | |
| dc.identifier.uri | https://dx.doi.org/10.11575/PRISM/41554 | |
| dc.language.iso | en | |
| dc.publisher.faculty | Graduate Studies | |
| dc.publisher.institution | University of Calgary | |
| dc.rights | University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission. | |
| dc.subject | Post Quantum Group signature scheme | |
| dc.subject.classification | Architecture | |
| dc.title | DGMT: A Fully Dynamic Hash-Based Group Signature | |
| dc.type | master thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Calgary | |
| thesis.degree.name | Master of Science (MSc) | |
| ucalgary.thesis.accesssetbystudent | I do not require a thesis withhold – my thesis will have open access and can be viewed and downloaded publicly as soon as possible. |