Sciweavers

490 search results - page 11 / 98
» Equivalent Keys of HPC
Sort
View
PEPM
2010
ACM
14 years 5 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
APAL
2010
124views more  APAL 2010»
13 years 8 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
SEC
1993
13 years 10 months ago
LUC: A New Public Key System
We describe public key cryptosystems and analyse the RSA cryptosystem, pointing out a weakness (already known) of the RSA system. We define Lucas functions and derive some of thei...
Peter J. Smith, Michael J. J. Lennon
CISIM
2007
IEEE
14 years 3 months ago
Universally Composable Key-Evolving Signature
The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving...
Jin Zhou, Yuefei Zhu, TingMao Chang, YaJuan Zhang
ICALP
1998
Springer
14 years 26 days ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr