Browse by Person
![]() | Up a level |
Bauer, Balthazar ; Farshim, Pooya ; Harasser, Patrick ; O'Neill, Adam (2022):
Beyond Uber: Instantiating Generic Groups via PGGs.
In: Lecture Notes in Computer Science, 13749, In: Theory of Cryptography, pp. 212-242,
Springer, 20th Theory of Cryptography Conference (TCC 2022), Chicago, USA, 07.-10.11.2022, ISBN 978-3-031-22367-9,
DOI: 10.1007/978-3-031-22368-6_8,
[Conference or Workshop Item]
Brzuska, Christina ; Farshim, Pooya ; Mittelbach, Arno
Dodis, Yevgeniy ; Nielsen, Arno Buus (eds.) (2015):
Random-Oracle Uninstantiability from Indistinguishability Obfuscation.
In: Lecture Notes in Computer Science 9015, In: Theory of Cryptography. TCC 2015., pp. 428-455,
Springer, Warsaw, Poland, ISBN 978-3-662-46497-7,
DOI: 10.1007/978-3-662-46497-7_17,
[Conference or Workshop Item]
Brzuska, Christina ; Farshim, Pooya ; Mittelbach, Arno
Garay, Arno A. ; Gennaro, Rosario (eds.) (2014):
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources.
In: Lecture Notes in Computer Science 8616, 1, In: Advances in Cryptology – CRYPTO 2014. 34th Annual Cryptology Conference. Santa Barbara, CA, USA. August 17-21, 2014. Proceedings., pp. 188-205,
Springer, Santa Barbara, CA, USA, ISBN 978-3-662-44370-5,
DOI: 10.1007/978-3-662-44371-2_11,
[Conference or Workshop Item]
Baecher, Paul ; Farshim, Pooya ; Fischlin, Marc ; Stam, Martijn (2013):
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions.
In: Lecture Notes in Computer Science, 7881, pp. 426-443. [Article]