165 search results - page 23 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
101
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
108
click to vote
TIT
2011
14 years 6 months ago
2011
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
106
click to vote
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
115
click to vote
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...