Concurrent signature scheme over braid groups
Zhang Xing-kai · Jisuanji yingyong yanjiu · 2010
To resist the quantum computing,this paper proposed a concurrent signature scheme over braid group on the difficulty of root extraction problem.The initial signer and the matching signer chose two keystones,respectively,which guaranteed the fairness.Analysis shows that before releasing the keystones,both signatures are ambiguous while upon release of the keystones,both signatures become binding to their true signers concurrently.