15 Publications

Mark all

[15]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
View | DOI | Download (ext.)
 
[14]
2018 | Conference Paper | IST-REx-ID: 6941   OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26
View | DOI | Download (ext.)
 
[13]
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821. Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4
View | DOI | Download (ext.) | arXiv
 
[12]
2017 | Conference Paper | IST-REx-ID: 6527   OA
Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031
View | DOI | Download (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13
View | Files available | DOI | Download (ext.)
 
[10]
2017 | Conference Paper | IST-REx-ID: 1175   OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38
View | Files available | DOI
 
[9]
2017 | Conference Paper | IST-REx-ID: 640   OA
Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:10.1007/978-3-319-56617-7_1
View | DOI | Download (ext.)
 
[8]
2017 | Conference Paper | IST-REx-ID: 1176   OA
Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:10.1109/EuroSP.2017.47
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 609   OA
Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17
View | DOI | Download (ext.)
 
[6]
2017 | Conference Paper | IST-REx-ID: 635   OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2
View | DOI | Download (ext.)
 
[5]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
View | DOI | Download (ext.)
 
[4]
2016 | Conference Paper | IST-REx-ID: 1365   OA
Alwen JF, Blocki J. Efficiently computing data-independent memory-hard functions. In: Vol 9815. Springer; 2016:241-271. doi:10.1007/978-3-662-53008-5_9
View | DOI | Download (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1652   OA
Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing. ACM; 2015:595-603. doi:10.1145/2746539.2746622
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1672   OA
Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. 2015;9216:763-780. doi:10.1007/978-3-662-48000-7_37
View | Files available | DOI
 
[1]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

15 Publications

Mark all

[15]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
View | DOI | Download (ext.)
 
[14]
2018 | Conference Paper | IST-REx-ID: 6941   OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26
View | DOI | Download (ext.)
 
[13]
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821. Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4
View | DOI | Download (ext.) | arXiv
 
[12]
2017 | Conference Paper | IST-REx-ID: 6527   OA
Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031
View | DOI | Download (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13
View | Files available | DOI | Download (ext.)
 
[10]
2017 | Conference Paper | IST-REx-ID: 1175   OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38
View | Files available | DOI
 
[9]
2017 | Conference Paper | IST-REx-ID: 640   OA
Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:10.1007/978-3-319-56617-7_1
View | DOI | Download (ext.)
 
[8]
2017 | Conference Paper | IST-REx-ID: 1176   OA
Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:10.1109/EuroSP.2017.47
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 609   OA
Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17
View | DOI | Download (ext.)
 
[6]
2017 | Conference Paper | IST-REx-ID: 635   OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2
View | DOI | Download (ext.)
 
[5]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
View | DOI | Download (ext.)
 
[4]
2016 | Conference Paper | IST-REx-ID: 1365   OA
Alwen JF, Blocki J. Efficiently computing data-independent memory-hard functions. In: Vol 9815. Springer; 2016:241-271. doi:10.1007/978-3-662-53008-5_9
View | DOI | Download (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1652   OA
Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing. ACM; 2015:595-603. doi:10.1145/2746539.2746622
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1672   OA
Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. 2015;9216:763-780. doi:10.1007/978-3-662-48000-7_37
View | Files available | DOI
 
[1]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed