Sciweavers

112 search results - page 13 / 23
» On properties of theories which preclude the existence of un...
Sort
View
ESOP
2006
Springer
13 years 11 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
CSFW
2012
IEEE
11 years 10 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
CCR
2004
62views more  CCR 2004»
13 years 7 months ago
Methodological frameworks for large-scale network analysis and design
This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocac...
Antonis Papachristodoulou, Lun Li, John C. Doyle
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
14 years 1 months ago
Masking at Gate Level in the Presence of Glitches
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
Wieland Fischer, Berndt M. Gammel
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...