Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Electronics (China)

A ring signature scheme over braid groups

Yun Wei, Guohua Xiong, Wan‐Su Bao, Xingkai Zhang

Published Jul 1, 2010• 1 citation
Publisher
DOI
10.1007/s11767-011-0417-2

Related papers

An Advanced Multivariate Convertible Ring Signature Scheme

Satyam Omar

Lecture notes in networks and systems•Jan 1, 2025•0 citations

BRCE: Braid-Ring Convolution Encryption – A Post-Abelian Cryptosystem Without Periodicity

Rahul Kundnani

Abstract We propose BRCE (Braid-Ring Convolutional Encryption), a novel quantum-resilient group ring-based encryption scheme built over the non-abelian structure of braid groups and their integral group rings. The encryption mechanism applies convolution-based masking with randomized braid elements to achieve semantic obfuscation without relying on periodic structures. Our design embeds high-entropy messages into non-commutative algebraic carriers , resulting in ciphertexts that resist both classical and quantum algebraic attacks. We provide a provable security reduction from the Conjugacy Search Problem (CSP) in braid groups and show that the scheme satisfies IND-CPA and IND-CCA security notions under reasonable pseudorandomness assumptions. We anchor security in a new hardness assump-tion—the Group Ring Convolution Inversion Problem (GRCIP)—tailored to non-abelian group rings. Further, we demonstrate that the structure resists reductions to the Hidden Subgroup Problem (HSP), positioning BRCE as a competitive post-quantum candidate rooted in topological and algebraic hardness. MSC 2020: 94A60, 20F36, 68Q12, 11T71

•Aug 25, 2025•0 citations

An Undeniable Signature Scheme Utilizing Module Lattices

Kunal Dey, Mansi Goyal, Aditi Kar Gangopadhyay +1 more

arXiv:2410.19220•Lecture notes in computer science•Jan 1, 2026•0 citations

Proxy blind signature scheme based on braid group

Xiufeng Zhao

Three types of traditional hard problem could be resolved by Shor,Boneh and Lipton's quantum algorithms in po-lynomial time.By the braid group constructed a lot of mathematics difficulties were not an effective solution under the conditions of the quantum computer.It seemed that braid group was a kind of considerable considerable cryptography platform in the future.This paper proposed a new proxy blind signature scheme based on conjugate search problem and the p-th root finding problem,and the exchangeable of the group operation between the elements in the left subgroup and the right subgroup of a braid group.Through program analysis shows that the new scheme is effective and feasible.

Jisuanji yingyong yanjiu•Jan 1, 2010•1 citation

A novel quantum ring signature scheme without using entangled states

Zihao Xiong, Aihan Yin

Quantum Information Processing•Mar 31, 2022•13 citations

Electronic Voting Scheme Based on a Quantum Ring Signature

Chi Qiu, Shibin Zhang, Yan Zuo Chang +2 more

International Journal of Theoretical Physics•Mar 26, 2021•17 citations
Abstract We propose BRCE (Braid-Ring Convolutional Encryption), a novel quantum-resilient group ring-based encryption scheme built over the non-abelian structure of braid groups and their integral group rings. The encryption mechanism applies convolution-based masking with randomized braid elements to achieve semantic obfuscation without relying on periodic structures. Our design embeds high-entropy messages into non-commutative algebraic carriers , resulting in ciphertexts that resist both classical and quantum algebraic attacks. We provide a provable security reduction from the Conjugacy Search Problem (CSP) in braid groups and show that the scheme satisfies IND-CPA and IND-CCA security notions under reasonable pseudorandomness assumptions. We anchor security in a new hardness assump-tion—the Group Ring Convolution Inversion Problem (GRCIP)—tailored to non-abelian group rings. Further, we demonstrate that the structure resists reductions to the Hidden Subgroup Problem (HSP), positioning BRCE as a competitive post-quantum candidate rooted in topological and algebraic hardness. MSC 2020: 94A60, 20F36, 68Q12, 11T71
Three types of traditional hard problem could be resolved by Shor,Boneh and Lipton's quantum algorithms in po-lynomial time.By the braid group constructed a lot of mathematics difficulties were not an effective solution under the conditions of the quantum computer.It seemed that braid group was a kind of considerable considerable cryptography platform in the future.This paper proposed a new proxy blind signature scheme based on conjugate search problem and the p-th root finding problem,and the exchangeable of the group operation between the elements in the left subgroup and the right subgroup of a braid group.Through program analysis shows that the new scheme is effective and feasible.