Abstract
The concept of a signed subgroup generator is introduced and an interactive proof-based identification and signature scheme is proposed. The scheme is symmetric in the sense that the same computational complexity and hardware for both the prover and verifier are required. It also requires a minimal level of computation and communications for secret information.
Original language | English |
---|---|
Pages (from-to) | 2022-2024 |
Number of pages | 3 |
Journal | Electronics Letters |
Volume | 35 |
Issue number | 23 |
DOIs | |
State | Published - 11 Nov 1999 |