641 | -- | 670 | Achiya Bar-On, Eli Biham, Orr Dunkelman, Nathan Keller. Efficient Slide Attacks |
671 | -- | 697 | Yehuda Lindell, Eran Omri, Hila Zarosim. Completeness for Symmetric Two-Party Functionalities: Revisited |
698 | -- | 736 | Gilad Asharov, Gil Segev. On Constructing One-Way Permutations from Indistinguishability Obfuscation |
737 | -- | 773 | Yehuda Lindell, Hila Zarosim. On the Feasibility of Extending Oblivious Transfer |
774 | -- | 797 | Vadim Lyubashevsky, Daniele Micciancio. Asymptotically Efficient Lattice-Based Digital Signatures |
798 | -- | 844 | Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas. Fast Garbling of Circuits Under Standard Assumptions |
845 | -- | 884 | Brice Minaud, Patrick Derbez, Pierre-Alain Fouque, Pierre Karpman. Key-Recovery Attacks on ASASA |
885 | -- | 916 | Anne Canteaut, Sergiu Carpov, Caroline Fontaine, Tancrède Lepoint, María Naya-Plasencia, Pascal Paillier, Renaud Sirdey. Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression |