Delegating signing rights in a multivariate proxy signature scheme
| Autor: | Kunal Dey, Tanmay Choudhury, Sumit Kumar Debnath, Pantelimon Stanica, Nibedita Kundu |
|---|---|
| Rok vydání: | 2023 |
| Předmět: |
Authentication
Post-quantum cryptography Algebra and Number Theory Theoretical computer science Computer Networks and Communications business.industry Applied Mathematics 020206 networking & telecommunications Cryptography Context (language use) 0102 computer and information sciences 02 engineering and technology 01 natural sciences Microbiology Digital signature 010201 computation theory & mathematics Discrete logarithm 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Proxy (statistics) business ElGamal encryption Computer Science::Cryptography and Security Mathematics |
| Zdroj: | Advances in Mathematics of Communications. 17:681-696 |
| ISSN: | 1930-5338 1930-5346 |
| DOI: | 10.3934/amc.2021016 |
| Popis: | In the context of digital signatures, the proxy signature holds a significant role of enabling an original signer to delegate its signing ability to another party (i.e., proxy signer). It has significant practical applications. Particularly it is useful in distributed systems, where delegation of authentication rights is quite common. For example, key sharing protocol, grid computing, and mobile communications. Currently, a large portion of existing proxy signature schemes are based on the hardness of problems like integer factoring, discrete logarithms, and/or elliptic curve discrete logarithms. However, with the rising of quantum computers, the problem of prime factorization and discrete logarithm will be solvable in polynomial-time, due to Shor's algorithm, which dilutes the security features of existing ElGamal, RSA, ECC, and the proxy signature schemes based on these problems. As a consequence, construction of secure and efficient post-quantum proxy signature becomes necessary. In this work, we develop a post-quantum proxy signature scheme Mult-proxy, relying on multivariate public key cryptography (MPKC), which is one of the most promising candidates of post-quantum cryptography. We employ a 5-pass identification protocol to design our proxy signature scheme. Our work attains the usual proxy criterion and a one-more-unforgeability criterion under the hardness of the Multivariate Quadratic polynomial (MQ) problem. It produces optimal size proxy signatures and optimal size proxy shares in the field of MPKC. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|