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

2021 | Conference Paper | IST-REx-ID: 10407 | OA
Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. 2021. Trojan-resilience without cryptography. TCC: Theory of Cryptography Conference, LNCS, vol. 13043, 397–428.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10408 | OA
Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13044, 222–253.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 486–517.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10609 | OA
Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for adaptively secure MPC without setup. 27th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: International Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2021 | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.
[Preprint] View | Files available | Download Preprint (ext.)
 
2021 | Thesis | IST-REx-ID: 10035 | OA
Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 550–581.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference.
[Preprint] View | Files available | Download Preprint (ext.)
 
2021 | Conference Paper | IST-REx-ID: 9969 | OA
Pietrzak KZ, Salem I, Schmid S, Yeo MX. 2021. LightPIR: Privacy-preserving route discovery for payment channel networks. 2021 IFIP Networking Conference (IFIP Networking).
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8322 | OA
Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.
[Preprint] View | DOI | Download Preprint (ext.)
 
2020 | Conference Paper | IST-REx-ID: 8339 | OA
Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.
[Preprint] View | DOI | Download Preprint (ext.)
 
2020 | Conference Paper | IST-REx-ID: 8987 | OA
Pietrzak KZ. 2020. Delayed authentication: Preventing replay and relay attacks in private contact tracing. Progress in Cryptology. INDOCRYPT: International Conference on Cryptology in IndiaLNCS vol. 12578, 3–15.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2020 | Conference Paper | IST-REx-ID: 7966 | OA
Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 12107, 475–506.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2020 | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 5887 | OA
Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.
[Preprint] View | DOI | Download Preprint (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6528 | OA
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2019 | Book Chapter | IST-REx-ID: 6726 | OA
Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.
[Preprint] View | DOI | Download Preprint (ext.)
 
2019 | Conference Paper | IST-REx-ID: 7136 | OA
Skórski M. 2019. Strong chain rules for min-entropy under few bits spoiled. 2019 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8849240.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477, 277–291.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. STOC: Symposium on Theory of Computing, 1103–1114.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443, 317–346.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2018 | Journal Article | IST-REx-ID: 10286 | OA
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 | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2018 | Thesis | IST-REx-ID: 83 | OA
Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 108 | OA
Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Journal Article | IST-REx-ID: 107 | OA
Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 300 | OA
Micciancio D, Walter M. 2018. On the bit security of cryptographic primitives. Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 302 | OA
Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821, 451–467.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 298 | OA
Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.
View | DOI | WoS
 
2018 | Conference Paper | IST-REx-ID: 6941 | OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Conference Paper | IST-REx-ID: 1175 | OA
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
 
2017 | Conference Paper | IST-REx-ID: 605 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | Conference Paper | IST-REx-ID: 650 | OA
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 | Conference Paper | IST-REx-ID: 6527 | OA
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 | Conference Paper | IST-REx-ID: 6526 | OA
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 | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 80, 39.
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 710 | OA
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 | Thesis | IST-REx-ID: 838 | OA
Rybar M. 2017. (The exact security of) Message authentication codes. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 6196 | OA
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 | Conference Paper | IST-REx-ID: 559 | OA
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 637 | OA
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 | Conference Paper | IST-REx-ID: 1174 | OA
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
 

Search

Filter Publications