Joel F Alwen
Pietrzak Group
17 Publications
2021 |Published| Conference Paper | IST-REx-ID: 10408 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Grafting key trees: Efficient key management for overlapping groups
J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.
2021 |Published| Conference Paper | IST-REx-ID: 10049 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
2018 |Published| Conference Paper | IST-REx-ID: 193 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
2018 |Published| Conference Paper | IST-REx-ID: 298 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
2018 |Published| Conference Paper | IST-REx-ID: 6941 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
SpaceMint: A cryptocurrency based on proofs of space
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
2017 |Published| Conference Paper | IST-REx-ID: 1175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Cumulative space in black-white pebbling and resolution
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
[Published Version]
View
| Files available
| DOI
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
2017 |Published| Conference Paper | IST-REx-ID: 609 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
2017 |Published| Conference Paper | IST-REx-ID: 635 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Scrypt is maximally memory hard
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
2017 |Published| Conference Paper | IST-REx-ID: 640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Depth-robust graphs and their cumulative memory complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
2017 |Published| Conference Paper | IST-REx-ID: 6527 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Practical graphs for optimal side-channel resistant memory-hard functions
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
2017 |Published| Conference Paper | IST-REx-ID: 559 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Beyond Hellman’s time-memory trade-offs with applications to proofs of space
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
2017 |Published| Conference Paper | IST-REx-ID: 1176 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
2016 |Published| Conference Paper | IST-REx-ID: 1231 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
2016 |Published| Conference Paper | IST-REx-ID: 1365 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
[Preprint]
View
| DOI
| Download Preprint (ext.)
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
2015 |Published| Conference Paper | IST-REx-ID: 1652 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
High parallel complexity graphs and memory-hard functions
J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.
2015 |Published| Conference Paper | IST-REx-ID: 1672 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Incoercible multi-party computation and universally composable receipt-free voting
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.
[Submitted Version]
View
| Files available
| DOI
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.
2013 |Published| Conference Paper | IST-REx-ID: 2259 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
[Published Version]
View
| Files available
| DOI
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
17 Publications
2021 |Published| Conference Paper | IST-REx-ID: 10408 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Grafting key trees: Efficient key management for overlapping groups
J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.
2021 |Published| Conference Paper | IST-REx-ID: 10049 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
2018 |Published| Conference Paper | IST-REx-ID: 193 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
2018 |Published| Conference Paper | IST-REx-ID: 298 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
2018 |Published| Conference Paper | IST-REx-ID: 6941 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
SpaceMint: A cryptocurrency based on proofs of space
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
2017 |Published| Conference Paper | IST-REx-ID: 1175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Cumulative space in black-white pebbling and resolution
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
[Published Version]
View
| Files available
| DOI
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
2017 |Published| Conference Paper | IST-REx-ID: 609 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
2017 |Published| Conference Paper | IST-REx-ID: 635 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Scrypt is maximally memory hard
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
2017 |Published| Conference Paper | IST-REx-ID: 640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Depth-robust graphs and their cumulative memory complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
2017 |Published| Conference Paper | IST-REx-ID: 6527 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Practical graphs for optimal side-channel resistant memory-hard functions
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
2017 |Published| Conference Paper | IST-REx-ID: 559 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Beyond Hellman’s time-memory trade-offs with applications to proofs of space
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
2017 |Published| Conference Paper | IST-REx-ID: 1176 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
2016 |Published| Conference Paper | IST-REx-ID: 1231 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
2016 |Published| Conference Paper | IST-REx-ID: 1365 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
[Preprint]
View
| DOI
| Download Preprint (ext.)
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
2015 |Published| Conference Paper | IST-REx-ID: 1652 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
High parallel complexity graphs and memory-hard functions
J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.
2015 |Published| Conference Paper | IST-REx-ID: 1672 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Incoercible multi-party computation and universally composable receipt-free voting
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.
[Submitted Version]
View
| Files available
| DOI
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.
2013 |Published| Conference Paper | IST-REx-ID: 2259 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
[Published Version]
View
| Files available
| DOI
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.