Pooya Farshim
Pooya Farshim
Verified email at york.ac.uk - Homepage
Title
Cited by
Cited by
Year
Certificateless Signcryption
M Barbosa, P Farshim
Proceedings of the 2008 ACM symposium on Information, computer and …, 2008
2772008
Generic constructions of identity-based and certificateless KEMs
K Bentahar, P Farshim, J Malone-Lee, NP Smart
Journal of Cryptology 21 (2), 178-199, 2008
1672008
Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
M Barbosa, P Farshim
CT-RSA 12, 296-312, 2012
742012
Efficient identity-based key encapsulation to multiple parties
M Barbosa, P Farshim
IMA International Conference on Cryptography and Coding, 428-441, 2005
602005
Indistinguishability obfuscation and UCEs: The case of computationally unpredictable sources
C Brzuska, P Farshim, A Mittelbach
Annual Cryptology Conference, 188-205, 2014
512014
Polly cracker, revisited
MR Albrecht, P Farshim, JC Faugere, L Perret
International Conference on the Theory and Application of Cryptology and …, 2011
512011
A more cautious approach to security against mass surveillance
JP Degabriele, P Farshim, B Poettering
International Workshop on Fast Software Encryption, 579-598, 2015
412015
The related-key security of iterated Even–Mansour ciphers
P Farshim, G Procter
International Workshop on Fast Software Encryption, 342-363, 2015
372015
On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
J Alwen, M Barbosa, P Farshim, R Gennaro, SD Gordon, S Tessaro, ...
IMA International Conference on Cryptography and Coding, 65-84, 2013
362013
Robust encryption, revisited
P Farshim, B Libert, KG Paterson, EA Quaglia
International Workshop on Public Key Cryptography, 352-368, 2013
352013
On the Semantic Security of Functional Encryption Schemes
M Barbosa, P Farshim
Public Key Cryptography 7778, 143-161, 2013
342013
On cipher-dependent related-key attacks in the ideal-cipher model
MR Albrecht, P Farshim, KG Paterson, GJ Watson
International Workshop on Fast Software Encryption, 128-145, 2011
342011
Multilinear maps from obfuscation
MR Albrecht, P Farshim, S Han, D Hofheinz, E Larraia, KG Paterson
Journal of Cryptology, 1-34, 2020
322020
Random-Oracle Uninstantiability from Indistinguishability Obfuscation
C Brzuska, P Farshim, A Mittelbach
TCC (2), 428-455, 2015
252015
Security of symmetric primitives under incorrect usage of keys
P Farshim, C Orlandi, R Rosie
IACR Transactions on Symmetric Cryptology, 449-473, 2017
232017
Secure cryptographic workflow in the standard model
M Barbosa, P Farshim
International Conference on Cryptology in India, 379-393, 2006
222006
SK− KEM: An Identity− based Kem
M Barbosa, L Chen, Z Cheng, M Chimley, A Dent, P Farshim, K Harrison, ...
Sumission to IEEE P 1363, 3, 2006
142006
Graded Encoding Schemes from Obfuscation
P Farshim, J Hesse, D Hofheinz, E Larraia
14*
Relations among notions of complete non-malleability: Indistinguishability characterisation and efficient construction without random oracles
M Barbosa, P Farshim
Information Security and Privacy, 145-163, 2010
132010
Randomness reuse: Extensions and improvements
M Barbosa, P Farshim
IMA International Conference on Cryptography and Coding, 257-276, 2007
132007
The system can't perform the operation now. Try again later.
Articles 1–20