Journal: J. Cryptology

Volume 31, Issue 3

641 -- 670Achiya Bar-On, Eli Biham, Orr Dunkelman, Nathan Keller. Efficient Slide Attacks
671 -- 697Yehuda Lindell, Eran Omri, Hila Zarosim. Completeness for Symmetric Two-Party Functionalities: Revisited
698 -- 736Gilad Asharov, Gil Segev. On Constructing One-Way Permutations from Indistinguishability Obfuscation
737 -- 773Yehuda Lindell, Hila Zarosim. On the Feasibility of Extending Oblivious Transfer
774 -- 797Vadim Lyubashevsky, Daniele Micciancio. Asymptotically Efficient Lattice-Based Digital Signatures
798 -- 844Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas. Fast Garbling of Circuits Under Standard Assumptions
845 -- 884Brice Minaud, Patrick Derbez, Pierre-Alain Fouque, Pierre Karpman. Key-Recovery Attacks on ASASA
885 -- 916Anne 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