Security

• Shoup and Rubin prove key is not revealed to powerful adversary

• Uses Bellare-Rogaway complexity theoretic techniques

• Confirmed by Dexter-Compton using lattice-theoretic approach

• Confirmed by Wallace-Gurevich using abstract state machines

Previous slide

Next slide

Back to first slide

View graphic version