2432 search results - page 160 / 487 » Cryptographic logical relations |
98
Voted
GC
2004
Springer
15 years 6 months ago
2004
Springer
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
99
Voted
PKC
2004
Springer
15 years 6 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
104
click to vote
TCC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
108
click to vote
CCS
2001
ACM
15 years 5 months ago
2001
ACM
We propose a novel and robust hashing paradigm that uses iterative geometric techniques and relies on observations that main geometric features within an image would approximately ...
121
Voted
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...