I am interested in the rigorous development of cryptographic primitives, security models, and relationship between primitives. Recently, I have been working on idealized models of computation such as the random-oracle and the ideal-cipher models and asymmetric cryptosystems such as functional and homomorphic encryption schemes. An up-to-date list of my publications appears below. See also my DBLP and Google Scholar pages.


[29] Pooya Farshim, Julia Hesse, Dennis Hofheinz, and Enrique Larraia.
Graded Encoding Schemes from Obfuscation.

To appear at PKC 2018.

[28] Pooya Farshim, Louiza Khati, and Damien Vergnaud.

Security of Even–Mansour Ciphers under Key-Dependent Messages.
IACR Transactions on Symmetric Cryptology 2017 (2), 84-104.

[27] Pooya Farshim, Claudio Orlandi, and Razvan Rosie.
Security of Symmetric Primitives under Incorrect Usage of Keys.
In María Naya-Plasencia and Bart Preneel, editors, IACR Transactions on Symmetric Cryptology ISSN 2519-173X, Vol. 2017, No. 1, pp. 449-473.

[26] Pooya Farshim and Arno Mittelbach.
Modeling Random Oracles under Unpredictable Queries.
In Thomas Peyrin, editor, FSE 2016, volume 9783 of LNCS, pages 453–473. Springer, 2016.

[25] Afonso Arriaga, Manuel Barbosa, and Pooya Farshim.
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation.
In Orr Dunkelman and Somitra K. Sanadhya, editors, INDOCRYPT 2016, volume 10095 on LNCS, pages 1–21, Springer, 2016.

[24] Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, and Kenneth G. Paterson.
Multilinear Maps from Obfuscation.
In Eyal Kushilevitz and Tal Malkin, editors, TCC 2016-A, volume 9562 of LNCS, pages 446-473. Springer, 2016.

[23] Jean Paul Degabriele, Pooya Farshim, and Bertram Poettering.
A More Cautious Approach to Security Against Mass Surveillance.
In Gregor Leander, editor, FSE 2015, volume 9054 of LNCS, pages 579-598. Springer, 2015.

[22] Pooya Farshim and Gordon Procter.
The Related-Key Security of Iterated Even-Mansour Ciphers.
In Gregor Leander, editor, FSE 2015, volume 9054 of LNCS, pages 342-363. Springer, 2015.

[21] Christina Brzuska, Pooya Farshim, and Arno Mittelbach.
Random-Oracle Uninstantiability from Indistinguishability Obfuscation.
In Yevgeniy Dodis and Jesper Buus Nielsen, editors, TCC 2015, volume 9015 of LNCS, pages 428-455. Springer, 2015.

[20] Christina Brzuska, Pooya Farshim, and Arno Mittelbach.
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources.
In Juan A. Garay and Rosario Gennaro, editors, CRYPTO 2014, volume 8616 of LNCS, pages 188-205. Springer, 2014.

[19] Manuel Barbosa and Pooya Farshim.
The Related-Key Analysis of Feistel Constructions.
In Carlos Cid and Christian Rechberger, editors, FSE 2014, volume 8540 of LNCS, pages 265-284. Springer, 2014.

[18] Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, and David A. Wilson.
On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.
In Martijn Stam, editor, Coding and Cryptography, 14th IMA International Conference, volume 8308 of LNCS, pages 65-84. Springer, 2013.

[17] Paul Baecher, Pooya Farshim, Marc Fischlin, and Martijn Stam.
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions.
In Thomas Johansson and Phong Nguyen, editors, EUROCRYPT 2013, volume 7881 of LNCS, pages 426-443. Springer, 2013.

[16] Pooya Farshim, Benoît Libert, Kenneth G. Paterson, and Elizabeth A. Quaglia.
Robust Encryption, Revisited.
In Kaoru Kurosawa, editor, PKC 2013, volume 7778 of LNCS, pages 352-368. Springer, 2013.

[15] Manuel Barbosa and Pooya Farshim.
On the Semantic Security of Functional Encryption Schemes.
In Kaoru Kurosawa, editor, PKC 2013, volume 7778 of LNCS, pages 143-161. Springer, 2013.

[14] Manuel Barbosa and Pooya Farshim.
Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation.
In Orr Dunkelman, editor, CT-RSA 2012, volume 7178 of LNCS, pages 296-312. Springer, 2012.

[13] Afonso Arriaga, Manuel Barbosa, and Pooya Farshim.
On the Joint Security of Signature and Encryption under Randomness Reuse: Efficiency and Security Amplification.
In Feng Bao, Pierangela Samarati, and Jianying Zhou, editors, ACNS 2012, volume 7341 of LNCS, pages 206-223. Springer, 2012.

[12] Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Gottfried Herold, and Ludovic Perret.
Polly Cracker, Revisited.
In Dong Hoon Lee and Xiaoyun Wang, editors, ASIACRYPT 2011, volume 7073 of LNCS, pages 179-196, Srpinger, 2011.
Journal version: Designs Codes Cryptography 79(2): 261-302, 2016.

[11] Martin R. Albrecht, Pooya Farshim, Kenneth G. Paterson, and Gaven J. Watson.
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model.
In Antoine Joux, editor, FSE 2011, volume 6733 of LNCS, pages 128-145. Springer, 2011.

[10] Manuel Barbosa and Pooya Farshim.
Relations among Notions of Complete Non-Malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles.
In Udaya Parampalli and Philip Hawkes, editors, ACISP 2010, volume 6168 of LNCS, pages 145-163. Springer, 2010.

[09] Manuel Barbosa and Pooya Farshim.
Strong Knowledge Extractors for Public-Key Encryption Schemes.
In Udaya Parampalli and Philip Hawkes, editors, ACISP 2010, volume 6168 of LNCS, pages 164-181. Springer, 2010.

[08] Manuel Barbosa and Pooya Farshim.
Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps.
In Bart Preneel, editor, AFRICACRYPT 2009, volume 5580 of LNCS, pages 235-253. Springer, 2009.

[07] Pooya Farshim and Bogdan Warinschi.
Certified Encryption Revisited.
In Bart Preneel, editor, AFRICACRYPT 2009, volume 5580 of LNCS, pages 179-197. Springer, 2009.

[06] Manuel Barbosa and Pooya Farshim.
Certificateless Signcryption.
In Masayuki Abe and Virgil D. Gligor, editors, ASIACCS 2008, pages 369-372. ACM Press, 2008.

[05] Kamel Bentahar, Pooya Farshim, John Malone-Lee, and Nigel P. Smart.
Generic Constructions of Identity-Based and Certificateless KEMs.
Journal of Cryptology, 21(2):178-199. Springer, 2008.

[04] Manuel Barbosa and Pooya Farshim.
Randomness Reuse: Improvements and Extensions.
In Steven D. Galbraith, editor, Coding and Cryptography, 9th IMA International Conference, volume 4887 of LNCS, pages 261-280. Springer, 2007.

[03] Manuel Barbosa, Liqun Chen, Zhaohui Cheng, Mark Chimley, Alexander W. Dent, Pooya Farshim, Keith Harrison, John Malone-Lee, Nigel P. Smart, and Frederik Vercauteren.
SK-KEM: An Identity-Based KEM.
Submission for IEEE P1363.3, 2006.

[02] Manuel Barbosa and Pooya Farshim.
Secure Cryptographic Workflow in the Standard Model.
In Rana Barua and Tanja Lange, editors, INDOCRYPT 2006, volume 4329 of LNCS, pages 379-393. Springer, 2006.

[01] Manuel Barbosa and Pooya Farshim.
Efficient Identity-Based Key Encapsulation to Multiple Parties.
In Nigel P. Smart, editor, Coding and Cryptography, 8th IMA International Conference, volume 3796 of LNCS, pages 428-441. Springer, 2005.


Pooya Farshim.
Extensions of Public-Key, Identity-Based and Certificateless Encryption Schemes.
Ph.D. thesis, Univeristy of Bristol, 2008.


Martin R. Albrecht (3), Joël AlwenAfonso Arriaga (2), Manuel Barbosa (13), Paul BaecherKamel BentaharChris Brzuska (2), Jean Paul DegabrieleJean-Charles FaugèreMarc FischlinRosario GennaroS. Dov Gordon,  Dennis Hofheinz, Louiza KhatiEnrique LarraiaBenoît Libert, John Malone-Lee, Arno Mittelbach (3), Claudio OrlandiKenneth G. Paterson (3), Ludovic Perret, Bertram PoetteringGordon ProcterElizabeth A. QuagliaRăzvan RoşieNigel P. SmartMartijn StamStefano Tessaro, Damien Vergnaud, Bogdan WarinschiGaven J. Watson, and David A. Wilson.