263 search results - page 10 / 53 » Discrete Symbol Calculus |
ANTS
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
ENTCS
2007
13 years 7 months ago
2007
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...