Jérémy Planul

According to our database, Jérémy Planul authored at least 8 papers between 2009 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2016

Privacy-Preserving Shortest Path Computation.

David J. Wu, Joe Zimmerman, Jérémy Planul, John C. Mitchell

Proceedings of the 23rd Annual Network and Distributed System Security Symposium, 2016

2013

Layout Randomization and Nondeterminism.

Martín Abadi, Jérémy Planul, Gordon D. Plotkin

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

On Layout Randomization for Arrays and Functions.

Martín Abadi, Jérémy Planul

Proceedings of the Principles of Security and Trust - Second International Conference, 2013

Oblivious Program Execution and Path-Sensitive Non-interference.

Jérémy Planul, John C. Mitchell

Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

2012

Types, compilers, and cryptography for secure distributed programming. (Typage, compilation, et cryptographie pour la programmation repartie securisée).

Jérémy Planul

PhD thesis, 2012

2011

Compiling Information-Flow Security to Minimal Trusted Computing Bases.

Cédric Fournet, Jérémy Planul

Proceedings of the Programming Languages and Systems, 2011

Information-flow types for homomorphic encryptions.

Cédric Fournet, Jérémy Planul, Tamara Rezk

Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2009

Secure Enforcement for Global Process Specifications.

Jérémy Planul, Ricardo Corin, Cédric Fournet

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009