Compositional Synthesis of Leakage Resilient Programs

@inproceedings{Blot2016CompositionalSO,
  title={Compositional Synthesis of Leakage Resilient Programs},
  author={Arthur Blot and Masaki Yamamoto and Tachio Terauchi},
  booktitle={POST},
  year={2016}
}
A promising approach to defend against side channel attacks is to build programs that are leakage resilient, in a formal sense. One such formal notion of leakage resilience is the n-threshold-probing model proposed in the seminal work by Ishai et al.i¾?[16]. In a recent worki¾?[9], Eldib and Wang have proposed a method for automatically synthesizing programs that are leakage resilient according to this model, for the case $$n=1$$. In this paper, we show that the n-threshold-probing model of… CONTINUE READING
2
Twitter Mentions

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Verified Proofs of Higher-Order Masking

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Measuring Information Leakage Using Generalized Gain Functions

  • 2012 IEEE 25th Computer Security Foundations Symposium
  • 2012
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Quantitative Information Flow - Verification Hardness and Possibilities

  • 2010 23rd IEEE Computer Security Foundations Symposium
  • 2010
VIEW 4 EXCERPTS

On the foundations of quantitative information flow

G. Smith
  • In FOSSACS 2009, pages 288–302,
  • 2009
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Assessing security threats of looping constructs

  • POPL '07
  • 2007
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL