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.
126 Publications
2017 |
Published |
Conference Paper |
IST-REx-ID: 605 |
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 |
Published |
Conference Paper |
IST-REx-ID: 609 |
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 |
Published |
Journal Article |
IST-REx-ID: 6196 |
Gazi P, Pietrzak KZ, Rybar M. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2017;2016(2):145-161. doi:10.13154/TOSC.V2016.I2.145-161
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 635 |
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 |
Published |
Conference Paper |
IST-REx-ID: 637 |
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:10.1007/978-3-319-63688-7_5
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2017 |
Published |
Conference Paper |
IST-REx-ID: 640 |
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 |
Published |
Conference Paper |
IST-REx-ID: 648 |
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 |
Published |
Conference Paper |
IST-REx-ID: 650 |
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 |
Published |
Conference Paper |
IST-REx-ID: 6526 |
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
2017 |
Published |
Conference Paper |
IST-REx-ID: 6527 |
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 |
Published |
Journal Article |
IST-REx-ID: 1187 |
Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. Journal of Cryptology. 2017;30(4):1238-1275. doi:10.1007/s00145-016-9247-3
[Submitted Version]
View
| Files available
| DOI
| WoS
2016 |
Published |
Journal Article |
IST-REx-ID: 1177 |
Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 2016;74(4):1321-1362. doi:10.1007/s00453-015-9997-6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1179 |
Pietrzak KZ, Maciej S. Pseudoentropy: Lower-bounds for chain rules and transformations. In: Vol 9985. Springer; 2016:183-203. doi:10.1007/978-3-662-53641-4_8
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1653 |
Okamoto T, Pietrzak KZ, Waters B, Wichs D. New realizations of somewhere statistically binding hashing and positional accumulators. In: Vol 9452. Springer; 2016:121-145. doi:10.1007/978-3-662-48797-6_6
[Submitted Version]
View
| Files available
| DOI
2016 |
Published |
Journal Article |
IST-REx-ID: 1479 |
Krenn S, Pietrzak KZ, Wadia A, Wichs D. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 2016;25(3):567-605. doi:10.1007/s00037-015-0120-9
[Submitted Version]
View
| Files available
| DOI
2016 |
Published |
Journal Article |
IST-REx-ID: 1592
Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 2016;29(2):363-421. doi:10.1007/s00145-014-9196-7
View
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1365 |
Alwen JF, Blocki J. Efficiently computing data-independent memory-hard functions. In: Vol 9815. Springer; 2016:241-271. doi:10.1007/978-3-662-53008-5_9
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1366 |
Gazi P, Tessaro S. Provably robust sponge-based PRNGs and KDFs. In: Vol 9665. Springer; 2016:87-116. doi:10.1007/978-3-662-49890-3_4
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1225 |
Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Vol 9841. Springer; 2016:391-408. doi:10.1007/978-3-319-44618-9_21
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1229 |
Abusalah HM, Fuchsbauer G, Pietrzak KZ. Offline witness encryption. In: Vol 9696. Springer; 2016:285-303. doi:10.1007/978-3-319-39555-5_16
[Submitted Version]
View
| Files available
| DOI