A solution for signing any directed transitive binary relation is presented by combining the proposed scheme with the undirected transitive signature schemes available.
将该方案与无向传递签名方案结合，提出一个可对任何有向二元传递关系进行签名的方案。
This pager sets up a new matrix distinguishing way of a transitive binary-relation in a finite set based on analysis of transitive binary-relation.
文章对可传递关系进行了相应的讨论，并在此基础上给出了有限集合上可传递二元关系的矩阵判别方法。
应用推荐