Sigma protocol for faster proof of simultaneous homomorphism relations
| Autor: | Ali Zaghian, Mahdi Sajadieh, Bagher Bagherpour |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Discrete mathematics
Computer Networks and Communications Group (mathematics) Sigma 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Cryptographic protocol 01 natural sciences Base (group theory) Automated theorem proving 010201 computation theory & mathematics Discrete logarithm Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering Homomorphism Protocol (object-oriented programming) Software Computer Science::Cryptography and Security Information Systems Mathematics |
| Zdroj: | IET Information Security. 13:508-514 |
| ISSN: | 1751-8717 |
| DOI: | 10.1049/iet-ifs.2018.5167 |
| Popis: | The Σ -protocols for homomorphism relations are one of the cryptographic protocols which are used to prove knowledge of homomorphism relations. The Schnorr protocol is one of the most famous Σ -protocols used for proving knowledge of discrete logarithm (DL) relation in which the verifier essentially performs one double-exponentiation (i.e. a group computation of the form axby ). A direct application of the Schnorr protocol for proving simultaneous knowledge of n DLs with a common base leads to a Σ -protocol in which the verifier performs n double-exponentiations. In this study, the authors propose another Σ -protocol for homomorphism relations. The proposed Σ -protocol has fast verification when is used to prove the simultaneous homomorphism relations with a common homomorphism. Also, when the DL instantiation (DL-instantiation) of the proposed Σ -protocol is used to prove simultaneous knowledge of n DLs with a common base, it leads to a Σ -protocol in which the verifier performs n+1 single-exponentiations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text