Research

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.

Publications

[31] Manuel Barbosa and Pooya Farshim.
Indifferentiable Authenticated Encryption.
CRYPTO 2018.

[30] Balthazar Bauer, Pooya Farshim, and Sogol Mazaheri.
Combiners for Backdoored Random Oracles.
CRYPTO 2018.

[29] Pooya Farshim, Julia Hesse, Dennis Hofheinz, and Enrique Larraia.
Graded Encoding Schemes from Obfuscation.
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.

[27] Pooya Farshim, Claudio Orlandi, and Razvan Rosie.
Security of Symmetric Primitives under Incorrect Usage of Keys.
IACR Transactions on Symmetric Cryptology 2017.

[26] Pooya Farshim and Arno Mittelbach.
Modeling Random Oracles under Unpredictable Queries.
FSE 2016.

[25] Afonso Arriaga, Manuel Barbosa, and Pooya Farshim.
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation.
INDOCRYPT 2016.

[24] Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, and Kenneth G. Paterson.
Multilinear Maps from Obfuscation.
TCC 2016-A.

[23] Jean Paul Degabriele, Pooya Farshim, and Bertram Poettering.
A More Cautious Approach to Security Against Mass Surveillance.
FSE 2015.

[22] Pooya Farshim and Gordon Procter.
The Related-Key Security of Iterated Even-Mansour Ciphers.
FSE 2015.

[21] Christina Brzuska, Pooya Farshim, and Arno Mittelbach.
Random-Oracle Uninstantiability from Indistinguishability Obfuscation.
TCC 2015.

[20] Christina Brzuska, Pooya Farshim, and Arno Mittelbach.
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources.
CRYPTO 2014.

[19] Manuel Barbosa and Pooya Farshim.
The Related-Key Analysis of Feistel Constructions.
FSE 2014.

[18] Paul Baecher, Pooya Farshim, Marc Fischlin, and Martijn Stam.
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions.
EUROCRYPT 2013.

[17] Pooya Farshim, Benoît Libert, Kenneth G. Paterson, and Elizabeth A. Quaglia.
Robust Encryption, Revisited.
PKC 2013.

[16] Manuel Barbosa and Pooya Farshim.
On the Semantic Security of Functional Encryption Schemes.
PKC 2013.

[15] 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.
IMA International Conference 2013.

[14] Manuel Barbosa and Pooya Farshim.
Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation.
CT-RSA 2012.

[13] Afonso Arriaga, Manuel Barbosa, and Pooya Farshim.
On the Joint Security of Signature and Encryption under Randomness Reuse: Efficiency and Security Amplification.
ACNS 2012.

[12] Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Gottfried Herold, and Ludovic Perret.
Polly Cracker, Revisited.
ASIACRYPT 2011. 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.
FSE 2011.

[10] Manuel Barbosa and Pooya Farshim.
Relations among Notions of Complete Non-Malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles.
ACISP 2010.

[09] Manuel Barbosa and Pooya Farshim.
Strong Knowledge Extractors for Public-Key Encryption Schemes.
ACISP 2010.

[08] Manuel Barbosa and Pooya Farshim.
Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps.
AFRICACRYPT 2009.

[07] Pooya Farshim and Bogdan Warinschi.
Certified Encryption Revisited.
AFRICACRYPT 2009.

[06] Manuel Barbosa and Pooya Farshim.
Certificateless Signcryption.
ASIACCS 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.
IMA International Conference 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.
INDOCRYPT 2006.

[01] Manuel Barbosa and Pooya Farshim.
Efficient Identity-Based Key Encapsulation to Multiple Parties.
IMA International Conference 2005.

Ph.D. Thesis

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

Co-authors

Martin R. Albrecht (3), Joël AlwenAfonso Arriaga (2), Paul BaecherManuel Barbosa (14), Balthazar Bauer, Kamel BentaharChris Brzuska (2), Jean Paul DegabrieleJean-Charles FaugèreMarc FischlinRosario GennaroS. Dov Gordon,  Dennis Hofheinz, Louiza KhatiEnrique LarraiaBenoît Libert, John Malone-Lee, Sogol Mazaheri, 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.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

.

Advertisements