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.
157 Publications
2018 |
Published |
Conference Paper |
IST-REx-ID: 7407 |
Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 59:1-59:25.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2018 |
Published |
Journal Article |
IST-REx-ID: 10286 |
Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.
[Published Version]
View
| Files available
| DOI
2018 |
Published |
Thesis | PhD |
IST-REx-ID: 83 |
Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 1174 |
Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 1175 |
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.
[Published Version]
View
| Files available
| DOI
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 1176 |
Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&P: European Symposium on Security and Privacy, 7961977.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
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
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.)
| WoS
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.)
| WoS
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.)
| WoS
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.)
| WoS
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.)
| WoS
2017 |
Published |
Thesis | PhD |
IST-REx-ID: 838 |
Rybar M. 2017. (The exact security of) Message authentication codes. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
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.)
| WoS
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.)
| WoS
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.)
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 697 |
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: Automata, Languages and Programming, LIPIcs, vol. 80, 39.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 710 |
Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, LIPIcs, vol. 81, 20.
[Published Version]
View
| Files available
| DOI
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: International Symposium on Information Theory, 8006529.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv