11716 search results - page 63 / 2344 » Computable symbolic dynamics |
103
click to vote
CCS
2008
ACM
15 years 1 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
FSTTCS
2008
Springer
15 years 28 days ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
EUROCRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
CAAP
1990
15 years 3 months ago
1990
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...