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. 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 |
Published |
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 |
Published |
Journal Article |
IST-REx-ID: 6196 |
Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 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. 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 |
Published |
Conference Paper |
IST-REx-ID: 637 |
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401, 133–163.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2017 |
Published |
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 |
Published |
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.)
2017 |
Published |
Conference Paper |
IST-REx-ID: 650 |
Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |
Published |
Conference Paper |
IST-REx-ID: 6526 |
Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 6527 |
Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.
[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. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.
[Submitted Version]
View
| Files available
| DOI
| WoS
2016 |
Published |
Journal Article |
IST-REx-ID: 1177 |
Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1179 |
Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 183–203.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1653 |
Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452, 121–145.
[Submitted Version]
View
| Files available
| DOI
2016 |
Published |
Journal Article |
IST-REx-ID: 1479 |
Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.
[Submitted Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1365 |
Alwen JF, Blocki J. 2016. Efficiently computing data-independent memory-hard functions. CRYPTO: International Cryptology Conference, LNCS, vol. 9815, 241–271.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1366 |
Gazi P, Tessaro S. 2016. Provably robust sponge-based PRNGs and KDFs. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9665, 87–116.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1225 |
Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. 2016. Practical round-optimal blind signatures in the standard model from weaker assumptions. SCN: Security and Cryptography for Networks, LNCS, vol. 9841, 391–408.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1229 |
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 285–303.
[Submitted Version]
View
| Files available
| DOI