Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
129 Publications
2018 | Journal Article | IST-REx-ID: 10286 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242. doi:10.13154/tches.v2018.i3.214-242
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 7407 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2018 | Thesis | IST-REx-ID: 83 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:10.15479/AT:ISTA:TH_1046
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 108 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:10.1109/ISIT.2018.8437654
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Journal Article | IST-REx-ID: 107 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the ACM. 2018;65(4). doi:10.1145/3178432
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 193 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 300 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Micciancio D, Walter M. On the bit security of cryptographic primitives. In: Vol 10820. Springer; 2018:3-28. doi:10.1007/978-3-319-78381-9_1
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 302 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Cohen B, Pietrzak KZ. Simple proofs of sequential work. In: Vol 10821. Springer; 2018:451-467. doi:10.1007/978-3-319-78375-8_15
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 298 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002
View
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 6941 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Conference Paper | IST-REx-ID: 1175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 605 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brody J, Dziembowski S, Faust S, Pietrzak KZ. Position based cryptography and multiparty communication complexity. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:56-81. doi:10.1007/978-3-319-70500-2_3
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 609 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 635 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 648 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 650 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:10.1007/978-3-319-55911-7_42
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 6527 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 6526 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski M. On the complexity of estimating Rènyi divergences. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE; 2017. doi:10.1109/isit.2017.8006529
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv