Proceedings
(with David Balbás, Dario Fiore, Damien Robissout and Claudio Soriente) Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing. CCS 2023: 1437-1451, 2023.
(with A. Faonio, C. Soriente and H. T. T. Truong). Auditable Asymmetric Password Authenticated Public Key Establishment, to appear in Proceedings of CANS 2022, Springer, 2022.
(with A. Russo, A. Fernández Anta, and S.P. Romano) Chirotonia: A Scalable and Secure e-Voting Framework based on Blockchains and Linkable Ring Signatures, IEEE Blockchain - Workshop on Blockchain Security, Application and Performance, Proceedings of 2021 IEEE International Conference on Blockchain, 471--424, 2021
(with C. Colombo, R. Steinwandt and P. Zajac) Secure Communication in the Quantum Era: (Group) Key Establishment. In: Palestini C. (eds) Advanced Technologies for Security Applications. NATO Science for Peace and Security Series B: Physics and Biophysics. Springer, Dordrecht, 2020
(with C. Colombo, M. Vella and P. Zajac) Applying Runtime Verification to Group Key Establishment. Computer Science Annual Workshop, University of Malta. Malta - November 2018.
(with S. Heidarvand and J. Villar ) Flexible anonymous subscription schemes. In CCIS, Vol 222, pp. 203--219, Springer Verlag, 2012
(with P. D’Arco, A. L. Pérez del Pozo, and C. Soriente) Size Hiding in Private Set Intersection: Existential Resultas and Constructions. Proc of the 5th International Conference on Cryptology (Africacrypt 2012). Lecture Notes in Computer Science, Vol. 7374, pp. 378—394, Springer Verlag, 2012.
(with S. Heidarvand and J. Villar) Anonymous subscription schemes (a flexible construction for on-line sevices). In Proceedings of SECRYPT 2010, pp. 120--131, 2012.
(with Michel Abdalla, Jens-Matthias Bohli y Rainer Steinwandt) (Password)-Authenticated Key Establishment: from 2-Party to Group, Proceedings of 3rd Theory of Cryptography Conference TCC 2007, Lecture Notes in Computer Science, 4392, Springer Verlag, pp. 499—514, 2007.
(with Jens-Matthias Bohli and Rainer Steinwandt) A Subliminal-Free Variant of ECDSA. Proceedings of 6th Information Hiding, Lecture Notes in Computer Science, vol. 4437, pp. 375-387, Springer Verlag, 2007.
(with C. Martínez, R. Steinwandt, and J. Villar) A new Cramer-Shoup like methodology for group based provably secure encryption schemes. Proceedings of 2nd Theory of Cryptography Conference TCC 2005, Lecture Notes in Computer Science, vol. 3378, pp. 495 - 509, Springer Verlag, 2005.
(with Mats Näsnuld and Igor E. Shparlinski) New results on the Hardness of Diffie-Hellman Bits . Proceedings of PKC 2004, Vol 2947 of Lecture Notes in Computer Science. ISBN:3-540-21018-0, pp. 159 - 172, Springer Verlag, 2004.
(with Mats Näsnuld and Igor E. Shparlinski) The Hidden Number Problem in Extension Fields in Its Applications. Proceedings of LATIN 2002, Vol 2286 of Lecture Notes in Computer Science. ISBN: 3-540-43400-3, 105-117, Springer Verlag, 2002.
(with Igor E. Shparlinski) On the Security of Diffie-Hellman Bits. Cryptography and Computational Number Theory (Proceedings of CCNT’99), de la serie: Progress in Computer Science and Applied Logic. ISBN: 3-7643-6510-2 , Vol. 20, 258--268, Birkhäuser Verlag, 2001.
(with Mats Näslund) A survey of Hard Core Functions. Cryptography and Computational Number Theory, de la serie: Progress in Computer Science and Applied Logic. ISBN: 3-7643-6510-2, Vol. 20, 227--255, Birkhäuser Verlag, 2001.