We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...
A multisignature scheme for specified group of verifiers needs a group of signers' cooperation to sign a message to a specified group of verifiers that must cooperate to check...
At the fourth ACM conference on electronic commerce (EC'03), S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature scheme using pairings (actually, this is a...
es of orderings (an abstract version of real spectras of formally real fields), for which they are expressed as local-global principles: A property of quadratic forms (expressed as...
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...