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
2015 | Conference Paper | IST-REx-ID: 1652 | 
Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing. ACM; 2015:595-603. doi:10.1145/2746539.2746622
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2015 | Conference Paper | IST-REx-ID: 1672 |
Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. In: Advances in Cryptology - CRYPTO 2015. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780. doi:10.1007/978-3-662-48000-7_37
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1669 |
Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98. doi:10.1007/978-3-319-22174-8_5
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1671 |
Gazi P, Pietrzak KZ, Tessaro S. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. In: Vol 9215. Springer; 2015:368-387. doi:10.1007/978-3-662-47989-6_18
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1668 |
Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 2015;9054:319-341. doi:10.1007/978-3-662-48116-5_16
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)