Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Fournet, Cedric Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 4 of 4 reviews    
  A messy state of the union: taming the composite state machines of TLS
Beurdouche B., Bhargavan K., Delignat-Lavaud A., Fournet C., Kohlweiss M., Pironti A., Strub P., Zinzindohoue J.  SP 2015 (Proceedings of the 2015 IEEE Symposium on Security and Privacy,May 17-21, 2015) 535-552, 2015.  Type: Proceedings

By bringing consolidated structure to the panoply of requirements that make up the transport layer security (TLS) standard, this paper allows practitioners to formulate a framework for testing how compliant several of their open-source...
...
Oct 5 2016  
  Private authentication
Abadi M., Fournet C. Theoretical Computer Science 322(3): 427-476, 2004.  Type: Article

This paper focuses on the privacy of communication between two or more mobile interlocutors (principals), and protecting their messages and their identities from third parties (a situation that can arise in mobile telephony and mobile ...
...
Mar 16 2005  
  Modern concurrency abstractions for C#
Benton N., Cardelli L., Fournet C. ACM Transactions on Programming Languages and Systems 26(5): 769-804, 2004.  Type: Article

Polyphonic C#, an extension of the C# language, is presented in this paper. It is based on the join calculus, and seeks to facilitate the development of concurrent programs. The main new features are asynchronous methods, and so-called...
...
Nov 2 2004  
  Stack inspection: Theory and variants
Fournet C., Gordon A. ACM Transactions on Programming Languages and Systems 25(3): 360-399, 2003.  Type: Article

For software written with components that have different levels of trust, safe runs are a major concern. Stack inspection is one technique used to ensure these safe runs. When untrusted and trusted components call each others’...
...
May 12 2003  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy