Joel F Alwen
Pietrzak Group
15 Publications
2018 | Conference Paper | IST-REx-ID: 298 | 
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
View
| DOI
| Download Preprint (ext.)
| arXiv
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
2018 | Conference Paper | IST-REx-ID: 6941 |
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.
View
| DOI
| Download Submitted Version (ext.)
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.
2018 | Conference Paper | IST-REx-ID: 193 |
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.
View
| DOI
| Download Submitted Version (ext.)
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.
2017 | Conference Paper | IST-REx-ID: 559 |
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.
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 | Conference Paper | IST-REx-ID: 609 |
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
2017 | Conference Paper | IST-REx-ID: 635 |
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.
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 | Conference Paper | IST-REx-ID: 640 |
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.
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 | Conference Paper | IST-REx-ID: 6527 |
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.
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 | Conference Paper | IST-REx-ID: 1175 |
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.
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 | Conference Paper | IST-REx-ID: 1176 |
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
2016 | Conference Paper | IST-REx-ID: 1231 |
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.
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 | Conference Paper | IST-REx-ID: 1365 |
Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
View
| DOI
| Download Preprint (ext.)
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
2015 | Conference Paper | IST-REx-ID: 1652 |
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.
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 | Conference Paper | IST-REx-ID: 1672 |
Incoercible multi-party computation and universally composable receipt-free voting
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, 9216 (2015) 763–780.
View
| Files available
| DOI
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, 9216 (2015) 763–780.
2013 | Conference Paper | IST-REx-ID: 2259 |
Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
View
| Files available
| DOI
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
15 Publications
2018 | Conference Paper | IST-REx-ID: 298 |
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
View
| DOI
| Download Preprint (ext.)
| arXiv
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
2018 | Conference Paper | IST-REx-ID: 6941 |
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.
View
| DOI
| Download Submitted Version (ext.)
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.
2018 | Conference Paper | IST-REx-ID: 193 |
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.
View
| DOI
| Download Submitted Version (ext.)
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.
2017 | Conference Paper | IST-REx-ID: 559 |
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.
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 | Conference Paper | IST-REx-ID: 609 |
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
2017 | Conference Paper | IST-REx-ID: 635 |
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.
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 | Conference Paper | IST-REx-ID: 640 |
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.
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 | Conference Paper | IST-REx-ID: 6527 |
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.
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 | Conference Paper | IST-REx-ID: 1175 |
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.
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 | Conference Paper | IST-REx-ID: 1176 |
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
View
| DOI
| Download Submitted Version (ext.)
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
2016 | Conference Paper | IST-REx-ID: 1231 |
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.
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 | Conference Paper | IST-REx-ID: 1365 |
Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
View
| DOI
| Download Preprint (ext.)
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
2015 | Conference Paper | IST-REx-ID: 1652 |
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.
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 | Conference Paper | IST-REx-ID: 1672 |
Incoercible multi-party computation and universally composable receipt-free voting
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, 9216 (2015) 763–780.
View
| Files available
| DOI
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, 9216 (2015) 763–780.
2013 | Conference Paper | IST-REx-ID: 2259 |
Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.
View
| Files available
| DOI
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.