174
click to vote
ISSTA
2012
ACM
13 years 7 months ago
2012
ACM
We introduce the concept of “residual investigation” for program analysis. A residual investigation is a dynamic check installed as a result of running a static analysis that ...
186
click to vote
ISSTA
2012
ACM
13 years 7 months ago
2012
ACM
Manual debugging is driven by experiments—test runs that narrow down failure causes by systematically confirming or excluding individual factors. The BUGEX approach leverages t...
181
click to vote
ISSTA
2012
ACM
13 years 7 months ago
2012
ACM
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
166
click to vote
ISSTA
2012
ACM
13 years 7 months ago
2012
ACM
Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumption...
183
click to vote
ISSTA
2012
ACM
13 years 7 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
147
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
It is notoriously difficult to create hardware that is immune from side channel and tampering attacks. A lot of recent literature, therefore, has instead considered algorithmic de...
150
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
We introduce a new definition of privacy called crowd-blending privacy that strictly relaxes the notion of differential privacy. Roughly speaking, k-crowd blending private saniti...
169
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
144
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
158
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...