635 search results - page 45 / 127 » Some Computational Problems Related to Pseudo-intents |
154
click to vote
PKC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we ļ¬rst introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...
153
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
177
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
201
click to vote
NEUROSCIENCE
2001
Springer
15 years 10 months ago
2001
Springer
We propose a theoretical framework for speciļ¬cation and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
159
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...