Sciweavers

490 search results - page 19 / 98
» Equivalent Keys of HPC
Sort
View
TCS
2008
13 years 8 months ago
Petri nets are less expressive than state-extended PA
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
Mojmír Kretínský, Vojtech Reh...
ADC
2006
Springer
128views Database» more  ADC 2006»
14 years 2 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
13 years 8 months ago
Some Grammatical Structures of Programming Languages as Simple Bracketed Languages
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
Boris Melnikov, Elena Kashlakova
ASIACRYPT
2003
Springer
14 years 1 months ago
A Traceable Block Cipher
In this paper1 we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys prov...
Olivier Billet, Henri Gilbert
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 8 months ago
Authentication from matrix conjugation
Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalen...
Dima Grigoriev, Vladimir Shpilrain