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
2017 | Conference Paper | IST-REx-ID: 605 | 
Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677, 56–81.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 609 |
Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 493–526.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 635 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 640 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 648 |
Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)