illustration of lock, four asterisks and a shield with a fingerprint on it on a green gradient background

Security, privacy, and cryptography

Leveraging Large Language Models for Automated Proof Synthesis in Rust

photos of PhD students Anunay Kulshrestha and Karan Newatia with a photo of Senior Cryptographer Josh Benaloh in the middle with a microphone icon on a blue and purple gradient background

Intern Insights: Dr. Josh Benaloh with Anunay Kulshrestha and Karan Newatia

Bayes Security (β*, higher better) of DP-SGD against membership and attribute inference on the Adult and Purchase datasets as a function of the number of training steps. The green dashed line shows the corresponding DP budget (ε). Membership and attribute inference curves decrease monotonically as the model is trained for longer and the accuracy and DP budget grow.

Closed-Form Bounds for DP-SGD against Record-level Inference

ProvCam: A Camera Module with Self-Contained TCB for Producing Verifiable Videos

Current selections

Sort by: Most recent

Clear selections

Search within these results

Content Types

Published Date

Publication

Pretty-Bad-Proxy: An Overlooked Adversary in Browsers’ HTTPS Deployments

Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang

Proceedings of the IEEE Symposium on Security and Privacy (Oakland) | May 2009

Proceedings of the IEEE Symposium on Security and Privacy (Oakland)

Publication

A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks

Jan Camenisch, Nishanth Chandran, Victor Shoup

Advances in Cryptology – EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings | May 2009

Advances in Cryptology – EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings

ISBN: 978-3-642-01000-2

Publication

On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results

Cynthia Dwork, Moni Naor, Omer Reingold, Guy Rothblum, Salil Vadhan

Proceedings of the 41th Annual ACM Symposium on Theory of Computing (STOC) | May 2009

Proceedings of the 41th Annual ACM Symposium on Theory of Computing (STOC)

Project

Video

(4,4)-split Jacobians of curves of genus 2

April 23, 2009 | Nils Bruin

Curves of genus 2 have an associated abelian surface, their jacobian. One can classify genus 2 curves according to special properties of their jacobians. For instance, a jacobian can be split: isogenous to a product…

57:05

Video

Advances in the CM method for elliptic curves

April 22, 2009 | Francois Morain

The complex multiplication method (CM method) builds an algebraic curve over a given finite field GF(q) and having an easily computable cardinality. Used at first for elliptic curves, this method is one of the building…