Up a level |
(2019) Highly Efficient Key Exchange Protocols with Optimal Tightness: Enabling real-world deployments with theoretically sound parameters.
(2019) Improving Automated Symbolic Analysis of Ballot Secrecy for E-voting Protocols: A Method Based on Sufficient Conditions.
(2019) Prime, Order Please! Revisiting Small Subgroup and Invalid Curve Attacks on Protocols using Diffie-Hellman.
(2019) Encoding Redundancy for Satisfaction-Driven Clause Learning.
(2019) Seems Legit: Automated Analysis of Subtle Attacks on Protocols that use Signatures.
(2019) Truth Assignments as Conditional Autarkies.
(2019) QRAT Polynomially Simulates \forall-Exp+Res.
(2019) Secure Authentication in the Grid: A Formal Analysis of DNP3 SAv5.
(2019) Strong Extension-Free Proof Systems.