Sciweavers

468 search results - page 34 / 94
» One-Way Functions in Complexity Theory
Sort
View
INDOCRYPT
2007
Springer
15 years 5 months ago
Linearization Attacks Against Syndrome Based Hashes
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
Markku-Juhani Olavi Saarinen
APAL
2007
131views more  APAL 2007»
14 years 11 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
EUROCRYPT
2004
Springer
15 years 4 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
JUCS
2002
110views more  JUCS 2002»
14 years 10 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
TNN
2010
173views Management» more  TNN 2010»
14 years 5 months ago
Global synchronization for discrete-time stochastic complex networks with randomly occurred nonlinearities and mixed time delays
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
Zidong Wang, Yao Wang, Yurong Liu