Blind Signature Protocol Based on Hidden Discrete Logarithm Problem Set in a Commutative Algebra

Minh Hiệu Nguyễn; D. N. Moldovyan; Nikolay A. Moldovyan; Minh‐Ha Le; Nguyễn Long Giang

doi:10.1007/s40995-021-01257-3

ScienceGate Book Chapters

JOURNAL ARTICLE

Blind Signature Protocol Based on Hidden Discrete Logarithm Problem Set in a Commutative Algebra

Minh Hiệu Nguyễn D. N. Moldovyan Nikolay A. Moldovyan Minh‐Ha Le Nguyễn Long Giang

Year: 2022 Journal: Iranian Journal of Science and Technology Transactions A Science Vol: 46 (1)Pages: 323-332 Publisher: Springer Science+Business Media

DOI: 10.1007/s40995-021-01257-3

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Commutative property Multiplicative function Signature (topology) Blinding Associative property Discrete logarithm Multiplicative group Discrete mathematics Algebra over a field Pure mathematics Public-key cryptography Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.01

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Blind Signature Protocol Based on Hidden Discrete Logarithm Problem Set in a Commutative Algebra

Metrics

Topics

Related Documents

Blind digital signature protocol on the base of hidden logarithm problem in a finite commutative algebra

Blind signature protocols based on hidden discrete logarithm problem

Digital Signature Algorithms Based on Hidden Discrete Logarithm Problem

A Multiparty Commutative Hashing Protocol Based on the Discrete Logarithm Problem

A Multiparty Commutative Hashing Protocol based on the Discrete Logarithm Problem