Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




88 Publications

2019 | Conference Paper | IST-REx-ID: 6528   OA
Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60
View | Files available | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6430
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. Adaptively secure proxy re-encryption. In: Vol 11443. Springer Nature; 2019:317-346. doi:10.1007/978-3-030-17259-6_11
View | DOI
 
2019 | Book Chapter | IST-REx-ID: 6726
Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9
View | DOI
 
2019 | Journal Article | IST-REx-ID: 5887
Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 7136   OA
Skórski M. Strong chain rules for min-entropy under few bits spoiled. In: 2019 IEEE International Symposium on Information Theory. IEEE; 2019. doi:10.1109/isit.2019.8849240
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6677
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. ACM Press; 2019:1103-1114. doi:10.1145/3313276.3316400
View | DOI
 
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.)
 
2018 | Conference Paper | IST-REx-ID: 302   OA
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
View | DOI | Download (ext.)
 
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
 
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.)
 
2018 | Journal Article | IST-REx-ID: 107
Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the ACM. 2018;65(4). doi:10.1145/3178432
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 108   OA
Obremski M, Skorski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:10.1109/ISIT.2018.8437654
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 300   OA
Micciancio D, Walter M. On the bit security of cryptographic primitives. In: Walter M, ed. Vol 10820. Springer; 2018:3-28. doi:10.1007/978-3-319-78381-9_1
View | DOI | Download (ext.)
 
2018 | Thesis | IST-REx-ID: 83   OA
Abusalah HM. Proof Systems for Sustainable Decentralized Cryptocurrencies. IST Austria; 2018. doi:10.15479/AT:ISTA:TH_1046
View | Files available | DOI
 
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.)
 
2017 | Conference Paper | IST-REx-ID: 605   OA
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
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 648   OA
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
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 650   OA
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
View | DOI | Download (ext.)
 
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.)
 
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.)
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed