Sciweavers

2432 search results - page 52 / 487
» Cryptographic logical relations
Sort
View
CONCUR
2010
Springer
14 years 10 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
JOC
2007
129views more  JOC 2007»
14 years 10 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
ICC
2009
IEEE
113views Communications» more  ICC 2009»
14 years 7 months ago
Using GMM and SVM-Based Techniques for the Classification of SSH-Encrypted Traffic
When employing cryptographic tunnels such as the ones provided by Secure Shell (SSH) to protect their privacy on the Internet, users expect two forms of protection. First, they aim...
Maurizio Dusi, Alice Este, Francesco Gringoli, Luc...
PPDP
2009
Springer
15 years 4 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Re...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
VMCAI
2010
Springer
15 years 7 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...