Sciweavers

264 search results - page 20 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
ICSE
2005
IEEE-ACM
14 years 9 months ago
An empirical evaluation of test case filtering techniques based on exercising complex information flows
Some software defects trigger failures only when certain complex information flows occur within the software. Profiling and analyzing such flows therefore provides a potentially i...
David Leon, Wes Masri, Andy Podgurski
DRM
2007
Springer
14 years 3 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
IJISEC
2006
106views more  IJISEC 2006»
13 years 9 months ago
Execution transactions for defending against software failures: use and evaluation
We examine the problem of containing buffer overflow attacks in a safe and efficient manner. Briefly, we automatically augment source code to dynamically catch stack and heap-based...
Stelios Sidiroglou, Angelos D. Keromytis
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
12 years 9 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
APLAS
2010
ACM
13 years 10 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...