log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation (Delignat-Lavaud et. al)
Ahmed Kosba - UMD
Friday, February 10, 2017, 11:00 am-12:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract
In this talk, we will mainly discuss the Cinderella paper [DFKP16]. Taking advantage of the recent progress in verifiable computation, the paper proposes a novel use of existing X.509 certificates and infrastructure. Instead of having the verifiers receive and validate chains of certificates, the verifiers receive and check proofs of their knowledge, their validity, and their compliance with application policies. In other words, the enforcement of the validation policies are outsourced to certificate owners in a cryptographically verifiable manner. This approach simplifies the task of the verifier, and results in smaller messages and stronger privacy for the certificate owners. The authors give two applications of their system in the contexts of TLS and electronic voting.
 
--
[DFKP16] Delignat-Lavaud, A., Fournet, C., Kohlweiss, M., & Parno, B. Cinderella: Turning shabby x. 509 certificates into elegant anonymous credentials with the magic of verifiable computation. In Security and Privacy (SP), 2016 IEEE Symposium on (pp. 235-254). IEEE.
 
Link: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/06/cinderella-1.pdf
This talk is organized by Ahmed Kosba