173 search results - page 6 / 35 » Groups with poly-context-free word problem |
INDOCRYPT
2003
Springer
14 years 22 days ago
2003
Springer
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
ACNS
2005
Springer
14 years 1 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
COLING
2010
13 years 2 months ago
2010
In opinion mining of product reviews, one often wants to produce a summary of opinions based on product features/attributes. However, for the same feature, people can express it w...
VL
2000
IEEE
13 years 12 months ago
2000
IEEE
The accurate formulation of boolean expressions is a notorious problem in programming languages and database query tools. This paper studies the ways that untrained users naturall...