default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPooya Farshim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Balthazar Bauer
, Pooya Farshim, Patrick Harasser, Markulf Kohlweiss:
The Uber-Knowledge Assumption: A Bridge to the AGM. IACR Commun. Cryptol. 1(3): 31 (2024)- [c35]Miguel Ambrona, Pooya Farshim, Patrick Harasser:
Block Ciphers in Idealized Models: Automated Proofs and New Security Results. CCS 2024: 2771-2785 - [c34]Jan Bobolz, Pooya Farshim, Markulf Kohlweiss, Akira Takahashi:
The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs. TCC (1) 2024: 90-124 - [i34]Jan Bobolz, Pooya Farshim, Markulf Kohlweiss, Akira Takahashi:
The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs. IACR Cryptol. ePrint Arch. 2024: 818 (2024) - [i33]Miguel Ambrona, Pooya Farshim, Patrick Harasser:
Block Ciphers in Idealized Models: Automated Proofs and New Security Results. IACR Cryptol. ePrint Arch. 2024: 1584 (2024) - 2023
- [i32]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Markulf Kohlweiss:
The Uber-Knowledge Assumption: A Bridge to the AGM. IACR Cryptol. ePrint Arch. 2023: 1601 (2023) - 2022
- [c33]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Adam O'Neill:
Beyond Uber: Instantiating Generic Groups via PGGs. TCC (3) 2022: 212-242 - [i31]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Adam O'Neill:
Beyond Uber: Instantiating Generic Groups via PGGs. IACR Cryptol. ePrint Arch. 2022: 1502 (2022) - 2021
- [c32]Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud:
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. CT-RSA 2021: 351-374 - [c31]Pooya Farshim, Stefano Tessaro:
Password Hashing and Preprocessing. EUROCRYPT (2) 2021: 64-91 - [c30]Geoffroy Couteau, Pooya Farshim, Mohammad Mahmoody:
Black-Box Uselessness: Composing Separations in Cryptography. ITCS 2021: 47:1-47:20 - [i30]Geoffroy Couteau, Pooya Farshim, Mohammad Mahmoody:
Black-Box Uselessness: Composing Separations in Cryptography. IACR Cryptol. ePrint Arch. 2021: 16 (2021) - [i29]Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud:
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. IACR Cryptol. ePrint Arch. 2021: 330 (2021) - 2020
- [j6]Martin R. Albrecht, Pooya Farshim, Shuai Han, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. J. Cryptol. 33(3): 1080-1113 (2020) - [c29]Pooya Farshim, Georg Fuchsbauer, Alain Passelègue:
Simpler Constructions of Asymmetric Primitives from Obfuscation. INDOCRYPT 2020: 715-738 - [c28]Yevgeniy Dodis, Pooya Farshim, Sogol Mazaheri, Stefano Tessaro:
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity. TCC (3) 2020: 241-273 - [i28]Yevgeniy Dodis, Pooya Farshim, Sogol Mazaheri, Stefano Tessaro:
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity. IACR Cryptol. ePrint Arch. 2020: 1199 (2020)
2010 – 2019
- 2019
- [j5]Aisling Connolly, Pooya Farshim, Georg Fuchsbauer:
Security of Symmetric Primitives against Key-Correlated Attacks. IACR Trans. Symmetric Cryptol. 2019(3): 193-230 (2019) - [i27]Aisling Connolly, Pooya Farshim, Georg Fuchsbauer:
Security of Symmetric Primitives against Key-Correlated Attacks. IACR Cryptol. ePrint Arch. 2019: 1000 (2019) - 2018
- [c27]Manuel Barbosa, Pooya Farshim:
Indifferentiable Authenticated Encryption. CRYPTO (1) 2018: 187-220 - [c26]Balthazar Bauer, Pooya Farshim, Sogol Mazaheri:
Combiners for Backdoored Random Oracles. CRYPTO (2) 2018: 272-302 - [c25]Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia:
Graded Encoding Schemes from Obfuscation. Public Key Cryptography (2) 2018: 371-400 - [i26]Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia:
Graded Encoding Schemes from Obfuscation. IACR Cryptol. ePrint Arch. 2018: 11 (2018) - [i25]Manuel Barbosa, Pooya Farshim:
Indifferentiable Authenticated Encryption. IACR Cryptol. ePrint Arch. 2018: 547 (2018) - [i24]Pooya Farshim, Georg Fuchsbauer, Alain Passelègue:
Simpler Constructions of Asymmetric Primitives from Obfuscation. IACR Cryptol. ePrint Arch. 2018: 576 (2018) - [i23]Balthazar Bauer, Pooya Farshim, Sogol Mazaheri:
Combiners for Backdoored Random Oracles. IACR Cryptol. ePrint Arch. 2018: 770 (2018) - 2017
- [j4]Pooya Farshim, Claudio Orlandi, Razvan Rosie:
Security of Symmetric Primitives under Incorrect Usage of Keys. IACR Trans. Symmetric Cryptol. 2017(1): 449-473 (2017) - [j3]Pooya Farshim, Louiza Khati, Damien Vergnaud:
Security of Even-Mansour Ciphers under Key-Dependent Messages. IACR Trans. Symmetric Cryptol. 2017(2): 84-104 (2017) - [e1]Pooya Farshim, Emil Simion:
Innovative Security Solutions for Information Technology and Communications - 10th International Conference, SecITC 2017, Bucharest, Romania, June 8-9, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10543, Springer 2017, ISBN 978-3-319-69283-8 [contents] - [i22]Pooya Farshim, Claudio Orlandi, Razvan Rosie:
Security of Symmetric Primitives under Incorrect Usage of Keys. IACR Cryptol. ePrint Arch. 2017: 288 (2017) - [i21]Pooya Farshim, Louiza Khati, Damien Vergnaud:
Security of Even-Mansour Ciphers under Key-Dependent Messages. IACR Cryptol. ePrint Arch. 2017: 475 (2017) - 2016
- [j2]Martin R. Albrecht, Jean-Charles Faugère, Pooya Farshim, Gottfried Herold, Ludovic Perret:
Polly Cracker, revisited. Des. Codes Cryptogr. 79(2): 261-302 (2016) - [c24]Pooya Farshim, Arno Mittelbach:
Modeling Random Oracles Under Unpredictable Queries. FSE 2016: 453-473 - [c23]Afonso Arriaga, Manuel Barbosa, Pooya Farshim:
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation. INDOCRYPT 2016: 227-247 - [c22]Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. TCC (A1) 2016: 446-473 - [i20]Afonso Arriaga, Manuel Barbosa, Pooya Farshim:
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation. IACR Cryptol. ePrint Arch. 2016: 18 (2016) - [i19]Pooya Farshim, Arno Mittelbach:
Modeling Random Oracles under Unpredictable Queries. IACR Cryptol. ePrint Arch. 2016: 423 (2016) - 2015
- [c21]Pooya Farshim, Gordon Procter:
The Related-Key Security of Iterated Even-Mansour Ciphers. FSE 2015: 342-363 - [c20]Jean Paul Degabriele, Pooya Farshim, Bertram Poettering:
A More Cautious Approach to Security Against Mass Surveillance. FSE 2015: 579-598 - [c19]Christina Brzuska, Pooya Farshim, Arno Mittelbach:
Random-Oracle Uninstantiability from Indistinguishability Obfuscation. TCC (2) 2015: 428-455 - [i18]Jean Paul Degabriele, Pooya Farshim, Bertram Poettering:
A More Cautious Approach to Security Against Mass Surveillance. IACR Cryptol. ePrint Arch. 2015: 748 (2015) - [i17]Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. IACR Cryptol. ePrint Arch. 2015: 780 (2015) - 2014
- [c18]Christina Brzuska, Pooya Farshim, Arno Mittelbach:
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources. CRYPTO (1) 2014: 188-205 - [c17]Manuel Barbosa, Pooya Farshim:
The Related-Key Analysis of Feistel Constructions. FSE 2014: 265-284 - [i16]Manuel Barbosa, Pooya Farshim:
The Related-Key Analysis of Feistel Constructions. IACR Cryptol. ePrint Arch. 2014: 93 (2014) - [i15]Christina Brzuska, Pooya Farshim, Arno Mittelbach:
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources. IACR Cryptol. ePrint Arch. 2014: 99 (2014) - [i14]Christina Brzuska, Pooya Farshim, Arno Mittelbach:
Random Oracle Uninstantiability from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 867 (2014) - [i13]Pooya Farshim, Gordon Procter:
The Related-Key Security of Iterated Even-Mansour Ciphers. IACR Cryptol. ePrint Arch. 2014: 953 (2014) - 2013
- [c16]Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam:
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions. EUROCRYPT 2013: 426-443 - [c15]Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, David A. Wilson:
On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption. IMACC 2013: 65-84 - [c14]Manuel Barbosa, Pooya Farshim:
On the Semantic Security of Functional Encryption Schemes. Public Key Cryptography 2013: 143-161 - [c13]Pooya Farshim, Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia:
Robust Encryption, Revisited. Public Key Cryptography 2013: 352-368 - [i12]Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam:
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions. IACR Cryptol. ePrint Arch. 2013: 350 (2013) - 2012
- [c12]Afonso Arriaga, Manuel Barbosa, Pooya Farshim:
On the Joint Security of Signature and Encryption Schemes under Randomness Reuse: Efficiency and Security Amplification. ACNS 2012: 206-223 - [c11]Manuel Barbosa, Pooya Farshim:
Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation. CT-RSA 2012: 296-312 - [i11]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Gottfried Herold, Ludovic Perret:
Polly Cracker, Revisited. Electron. Colloquium Comput. Complex. TR12 (2012) - [i10]Afonso Arriaga, Manuel Barbosa, Pooya Farshim:
On the Joint Security of Signature and Encryption Schemes under Randomness Reuse: Efficiency and Security Amplification. IACR Cryptol. ePrint Arch. 2012: 382 (2012) - [i9]Manuel Barbosa, Pooya Farshim:
Semantically Secure Functional Encryption, Revisited. IACR Cryptol. ePrint Arch. 2012: 474 (2012) - [i8]Pooya Farshim, Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia:
Robust Encryption, Revisited. IACR Cryptol. ePrint Arch. 2012: 673 (2012) - 2011
- [c10]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret:
Polly Cracker, Revisited. ASIACRYPT 2011: 179-196 - [c9]Martin R. Albrecht, Pooya Farshim, Kenneth G. Paterson, Gaven J. Watson:
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model. FSE 2011: 128-145 - [i7]Martin R. Albrecht, Pooya Farshim, Kenneth G. Paterson, Gaven J. Watson:
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model. IACR Cryptol. ePrint Arch. 2011: 213 (2011) - [i6]Manuel Barbosa, Pooya Farshim:
Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation. IACR Cryptol. ePrint Arch. 2011: 215 (2011) - [i5]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret:
Polly Cracker, Revisited. IACR Cryptol. ePrint Arch. 2011: 289 (2011) - 2010
- [c8]Manuel Barbosa, Pooya Farshim:
Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles. ACISP 2010: 145-163 - [c7]Manuel Barbosa, Pooya Farshim:
Strong Knowledge Extractors for Public-Key Encryption Schemes. ACISP 2010: 164-181
2000 – 2009
- 2009
- [c6]Pooya Farshim, Bogdan Warinschi:
Certified Encryption Revisited. AFRICACRYPT 2009: 179-197 - [c5]Manuel Barbosa, Pooya Farshim:
Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps. AFRICACRYPT 2009: 235-253 - 2008
- [j1]Kamel Bentahar, Pooya Farshim, John Malone-Lee, Nigel P. Smart:
Generic Constructions of Identity-Based and Certificateless KEMs. J. Cryptol. 21(2): 178-199 (2008) - [c4]Manuel Barbosa, Pooya Farshim:
Certificateless signcryption. AsiaCCS 2008: 369-372 - [i4]Manuel Barbosa, Pooya Farshim:
Certificateless Signcryption. IACR Cryptol. ePrint Arch. 2008: 143 (2008) - 2007
- [c3]Manuel Barbosa, Pooya Farshim:
Randomness Reuse: Extensions and Improvements. IMACC 2007: 257-276 - 2006
- [c2]Manuel Barbosa, Pooya Farshim:
Secure Cryptographic Workflow in the Standard Model. INDOCRYPT 2006: 379-393 - [i3]Manuel Barbosa, Pooya Farshim:
Secure Cryptographic Workflow in the Standard Model. IACR Cryptol. ePrint Arch. 2006: 450 (2006) - 2005
- [c1]Manuel Barbosa, Pooya Farshim:
Efficient Identity-Based Key Encapsulation to Multiple Parties. IMACC 2005: 428-441 - [i2]Kamel Bentahar, Pooya Farshim, John Malone-Lee, Nigel P. Smart:
Generic Constructions of Identity-Based and Certificateless KEMs. IACR Cryptol. ePrint Arch. 2005: 58 (2005) - [i1]Manuel Barbosa, Pooya Farshim:
Efficient Identity-Based Key Encapsulation to Multiple Parties. IACR Cryptol. ePrint Arch. 2005: 217 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
