Sciweavers

441 search results - page 37 / 89
» A Method for Proving Observational Equivalence
Sort
View
CARDIS
1998
Springer
161views Hardware» more  CARDIS 1998»
14 years 1 months ago
Formal Proof of Smart Card Applets Correctness
: The new Gemplus smart card is based on the Java technology, embedding a virtual machine. The security policy uses mechanisms that are based on Java properties. This language prov...
Jean-Louis Lanet, Antoine Requet
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
ENTCS
2007
81views more  ENTCS 2007»
13 years 8 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
ORDER
2006
99views more  ORDER 2006»
13 years 8 months ago
Countably Complementable Linear Orderings
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
Antonio Montalbán
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 8 months ago
Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids
We study matroidal networks introduced by Dougherty et al., who showed that if a network is scalar-linearly solvable over some finite field, then the network is a matroidal network...
Anthony Kim, Muriel Médard