Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Lightweight digital signature with secretly embedded warning

Kutyłowski M., Kubiak P.

Control and Cybernetics

2013

Vol. 42, no. 4

825--827

We show how a signatory can indicate coercion by embedding a secret message into the signature. Our scheme is practical and applies to standard signature schemes unlike the recent construction of Durnoga et al. (2013). The construction follows directly from kleptographic techniques due to Moti Yung and Adam Young.

Communication complexity for multi-speed cooperating automata

Jurdziński T., Kutyłowski M., Rzechonek P., Zatopiański J.

Prace Naukowe Instytutu Matematyki Politechniki Wrocławskiej. Konferencje

2001

Vol. 24, nr 3

17-30

We consider bounded memory asynchronous systems. They consist of finite automata working independently and communicating by exchanging messages. We discuss what impact the differences in timing models on computational power of such systems have. It is known that a total lack of synchronization has profound consequences for computational power of systems of automata. Lower bounds found for this model indicate that the only way to perform a nontrivial computation would be to re-synchronize the automata every 0(1) steps. We examine much weaker form of asynchronism. We consider the model in which automata work with constant speeds, but the speed might be different for each automaton, and the automata have no knowledge about the speeds. (We call this model multi-speed systems of finite automata.) In particular, it may happen that some speed cannot be expressed exactly by the means of internal states of automata. Nevertheless, we expect the automata to compute the correct output. The main result of this paper is that, quite unexpectedly, the systems described might be as powerful as synchronous systems, where all automata work with the same speed. More precisely, some languages, which have been candidates for distinguishing multi-speed and synchronous models, can be recognized by multi-speed systems with approximately the same number of messages sent.