15 Publications

Mark all

[15]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
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. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957. 480–499.
View | DOI | Download (ext.)
 
[13]
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821. 99–130.
View | DOI | Download (ext.) | arXiv
 
[12]
2017 | Conference Paper | IST-REx-ID: 6527   OA
Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security 1001–1017.
View | DOI | Download (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625. 357–379.
View | Files available | DOI | Download (ext.)
 
[10]
2017 | Conference Paper | IST-REx-ID: 1175   OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67. 38:1-38-21.
View | Files available | DOI
 
[9]
2017 | Conference Paper | IST-REx-ID: 640   OA
Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 3–32.
View | DOI | Download (ext.)
 
[8]
2017 | Conference Paper | IST-REx-ID: 1176   OA
Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 609   OA
Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677. 493–526.
View | DOI | Download (ext.)
 
[6]
2017 | Conference Paper | IST-REx-ID: 635   OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 33–62.
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. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666. 358–387.
View | DOI | Download (ext.)
 
[4]
2016 | Conference Paper | IST-REx-ID: 1365   OA
Alwen JF, Blocki J. 2016. Efficiently computing data-independent memory-hard functions. CRYPTO: International Cryptology Conference, LNCS, vol. 9815. 241–271.
View | DOI | Download (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1652   OA
Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard functions. Proceedings of the 47th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing 595–603.
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1672   OA
Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation and universally composable receipt-free voting. 9216, 763–780.
View | Files available | DOI
 
[1]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed

15 Publications

Mark all

[15]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
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. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957. 480–499.
View | DOI | Download (ext.)
 
[13]
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821. 99–130.
View | DOI | Download (ext.) | arXiv
 
[12]
2017 | Conference Paper | IST-REx-ID: 6527   OA
Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security 1001–1017.
View | DOI | Download (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625. 357–379.
View | Files available | DOI | Download (ext.)
 
[10]
2017 | Conference Paper | IST-REx-ID: 1175   OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67. 38:1-38-21.
View | Files available | DOI
 
[9]
2017 | Conference Paper | IST-REx-ID: 640   OA
Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 3–32.
View | DOI | Download (ext.)
 
[8]
2017 | Conference Paper | IST-REx-ID: 1176   OA
Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 609   OA
Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677. 493–526.
View | DOI | Download (ext.)
 
[6]
2017 | Conference Paper | IST-REx-ID: 635   OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 33–62.
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. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666. 358–387.
View | DOI | Download (ext.)
 
[4]
2016 | Conference Paper | IST-REx-ID: 1365   OA
Alwen JF, Blocki J. 2016. Efficiently computing data-independent memory-hard functions. CRYPTO: International Cryptology Conference, LNCS, vol. 9815. 241–271.
View | DOI | Download (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1652   OA
Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard functions. Proceedings of the 47th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing 595–603.
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1672   OA
Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation and universally composable receipt-free voting. 9216, 763–780.
View | Files available | DOI
 
[1]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed