Blind Signature Protocol Based on Hidden Discrete Logarithm Problem Set in a Commutative Algebra
Iranian Journal of Science and Technology, Transactions A: Science(2022)
摘要
A new blind signature scheme is proposed which is characterized in that it is based on a hidden discrete logarithm problem defined in a finite commutative associative algebra. The used algebraic support represents a 4-dimensional commutative associative algebra defined over the ground finite field GF ( p ), commutative group of which possesses 4-dimensional cyclicity. The public key represents a triple of vectors contained in different cyclic subgroup of the multiplicative group. Correspondingly, three different blinding factors are used to insure the anonymity property of the introduced blind signature protocol.
更多查看译文
关键词
Information security,Post-quantum cryptography,Blind signature,Finite associative algebra,Commutative algebra,Multi-dimensional cyclicity
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要