159 search results - page 3 / 32 » Weak Equivalences in Psi-Calculi |
ASIACRYPT
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
76
Voted
ENTCS
2006
14 years 9 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
CSL
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
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...