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.




127 Publications

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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
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
[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 | 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
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
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
[Published Version] View | Files available | DOI
 
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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
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
[Submitted Version] View | DOI | Download Submitted Version (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
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications